:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kumar, Syamantak, Sarkar, Purnamrita, Tian, Kevin, Zhang, Peiyuan
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Data Structures and Algorithms Optimization and Control
Online Access:	https://arxiv.org/abs/2603.02607
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Spike-and-Slab Posterior Sampling in High Dimensions
by: Kumar, Syamantak, et al.
Published: (2025)

Omnipredicting Single-Index Models with Multi-Index Models
by: Hu, Lunjia, et al.
Published: (2024)

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

Separating Oblivious and Adaptive Models of Variable Selection
by: Chen, Ziyun, et al.
Published: (2026)

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

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
by: Jambulapati, Arun, et al.
Published: (2024)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
by: Chen, Yilun, et al.
Published: (2025)

Optimal Scalarizations for Sublinear Hypervolume Regret
by: Zhang, Qiuyi
Published: (2023)

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

Infrequent Resolving Algorithm for Online Linear Programming
by: Li, Guokai, et al.
Published: (2024)

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

Multi-LLM Query Optimization
by: Dean, Arlen, et al.
Published: (2026)

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

Randomized Kaczmarz Methods with Beyond-Krylov Convergence
by: Dereziński, Michał, et al.
Published: (2025)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)

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

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

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

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

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

Negative Momentum for Convex-Concave Optimization
by: Shugart, Henry, et al.
Published: (2026)

Convex Optimization with Nested Evolving Feasible Sets
by: M., Karthick Krishna, et al.
Published: (2026)

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

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

Extended convexity and smoothness and their applications in deep learning
by: Qi, Binchuan, et al.
Published: (2024)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)

Non-Euclidean High-Order Smooth Convex Optimization
by: Contreras, Juan Pablo, et al.
Published: (2024)

Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)

Oracle-based Uniform Sampling from Convex Bodies
by: Dang, Thanh, et al.
Published: (2025)