Copertina

Exploiting Low-Rank Structure in Max-K-Cut Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Stevens, Ria, Liao, Fangshuo, Su, Barbara, Li, Jianqiang, Kyrillidis, Anastasios
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Machine Learning Optimization and Control Quantum Physics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Convergence Analysis of Two-Layer Neural Networks under Gaussian Input Masking
di: Kolomvaki, Afroditi, et al.
Pubblicazione: (2026)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
di: Kim, Junhyung Lyle, et al.
Pubblicazione: (2024)

Quantum EigenGame for excited state calculation
di: Quiroga, David, et al.
Pubblicazione: (2025)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
di: Li, Tongyang, et al.
Pubblicazione: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
di: Shi, Haoyan, et al.
Pubblicazione: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
di: Gu, Yuzhou, et al.
Pubblicazione: (2023)

Guided by the Experts: Provable Feature Learning Dynamic of Soft-Routed Mixture-of-Experts
di: Liao, Fangshuo, et al.
Pubblicazione: (2025)

Provable Accelerated Convergence of Nesterov's Momentum for Deep ReLU Neural Networks
di: Liao, Fangshuo, et al.
Pubblicazione: (2023)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
di: Shugart, Henry, et al.
Pubblicazione: (2025)

Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
di: Dereziński, Michał, et al.
Pubblicazione: (2025)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
di: Cai, Yang, et al.
Pubblicazione: (2022)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
di: Su, Yuexin, et al.
Pubblicazione: (2025)

Min-Max Connected Multiway Cut
di: Tiwary, Hans Raj, et al.
Pubblicazione: (2026)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
di: Fountoulakis, Kimon, et al.
Pubblicazione: (2026)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
di: Salem, Jad, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms for the Bahncard Problem
di: Zhao, Hailiang, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
di: Grigorescu, Elena, et al.
Pubblicazione: (2024)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
di: Zhong, Dawei, et al.
Pubblicazione: (2024)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
di: Li, Shuyao, et al.
Pubblicazione: (2024)

Quantum Langevin Dynamics for Optimization
di: Chen, Zherui, et al.
Pubblicazione: (2023)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
di: Zhang, Yexin, et al.
Pubblicazione: (2024)

One Rank at a Time: Cascading Error Dynamics in Sequential Learning
di: Vandchali, Mahtab Alizadeh, et al.
Pubblicazione: (2025)

Provable Model-Parallel Distributed Principal Component Analysis with Parallel Deflation
di: Liao, Fangshuo, et al.
Pubblicazione: (2025)

Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
di: Tate, Reuben, et al.
Pubblicazione: (2024)

Gradient Testing and Estimation by Comparisons
di: Tao, Xiwen, et al.
Pubblicazione: (2024)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
di: Kim, Jung-hun, et al.
Pubblicazione: (2021)

Constrained and Composite Sampling via Proximal Sampler
di: Dang, Thanh, et al.
Pubblicazione: (2026)

Importance Sparsification for Sinkhorn Algorithm
di: Li, Mengyu, et al.
Pubblicazione: (2023)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

Robust Learning of a Group DRO Neuron
di: Cao, Guyang, et al.
Pubblicazione: (2026)

Online Linear Programming with Replenishment
di: Chen, Yuze, et al.
Pubblicazione: (2026)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
di: Chakraborty, Somnath, et al.
Pubblicazione: (2020)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
di: Shugart, Henry, et al.
Pubblicazione: (2025)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
di: Kook, Yunbum, et al.
Pubblicazione: (2023)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
di: Zhang, Hongyang R., et al.
Pubblicazione: (2023)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
di: Jambulapati, Arun, et al.
Pubblicazione: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Non-Stationary Online Resource Allocation: Learning from a Single Sample
di: Feng, Yiding, et al.
Pubblicazione: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2024)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
di: Li, Shuyao, et al.
Pubblicazione: (2024)