:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chauhan, Rohan, Panageas, Ioannis
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2509.20993
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)

Better Models and Algorithms for Learning Ising Models from Dynamics
by: Gaitonde, Jason, et al.
Published: (2025)

Improved Approximations for Hard Graph Problems using Predictions
by: Aamand, Anders, et al.
Published: (2025)

Semi-Bandit Learning for Monotone Stochastic Optimization
by: Agarwal, Arpit, et al.
Published: (2023)

Computational and Statistical Hardness of Calibration Distance
by: Qiao, Mingda
Published: (2026)

The Query Complexity of Local Search in Rounds on General Graphs
by: Brânzei, Simina, et al.
Published: (2026)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

Sample-efficient Multiclass Calibration under $\ell_{p}$ Error
by: Bairaktari, Konstantina, et al.
Published: (2025)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
by: Gayen, Sutanu, et al.
Published: (2024)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
by: Oki, Taihei, et al.
Published: (2026)

On Sampling from Ising Models with Spectral Constraints
by: Galanis, Andreas, et al.
Published: (2024)

Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
by: Ghuge, Rohan, et al.
Published: (2025)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
by: Axiotis, Kyriakos, et al.
Published: (2024)

Hardness of Maximum Likelihood Learning of DPPs
by: Grigorescu, Elena, et al.
Published: (2022)

Finite Sample Bounds for Learning with Score Matching
by: Smedira, Devin, et al.
Published: (2026)

Distribution Learning Meets Graph Structure Sampling
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Learning Juntas under Markov Random Fields
by: Chandrasekaran, Gautam, et al.
Published: (2025)

Reliable Learning of Halfspaces under Gaussian Marginals
by: Diakonikolas, Ilias, et al.
Published: (2024)

On approximating the $f$-divergence between two Ising models
by: Feng, Weiming, et al.
Published: (2025)

Sample-Adaptivity Tradeoff in On-Demand Sampling
by: Haghtalab, Nika, et al.
Published: (2025)

Hardness of Learning Boolean Functions from Label Proportions
by: Guruswami, Venkatesan, et al.
Published: (2024)

Testable Learning of General Halfspaces under Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2026)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
by: Qin, Hao, et al.
Published: (2025)

Chasing Convex Functions with Long-term Constraints
by: Lechowicz, Adam, et al.
Published: (2024)

Learning Intersections of Two Margin Halfspaces under Factorizable Distributions
by: Diakonikolas, Ilias, et al.
Published: (2025)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
by: Cheng, Kangke, et al.
Published: (2026)

Single-Sample and Robust Online Resource Allocation
by: Ghuge, Rohan, et al.
Published: (2025)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, et al.
Published: (2024)

Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals
by: Guo, Anxin, et al.
Published: (2024)

Learning the Sherrington-Kirkpatrick Model Even at Low Temperature
by: Chandrasekaran, Gautam, et al.
Published: (2024)

Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
by: Laber, Eduardo S., et al.
Published: (2024)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
by: Chen, Yixin, et al.
Published: (2020)

Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
by: Qin, Yilong, et al.
Published: (2023)

Computational-Statistical Tradeoffs at the Next-Token Prediction Barrier: Autoregressive and Imitation Learning under Misspecification
by: Rohatgi, Dhruv, et al.
Published: (2025)

Thompson Sampling Itself is Differentially Private
by: Ou, Tingting, et al.
Published: (2024)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
by: Amanatidis, Georgios, et al.
Published: (2020)

Optimal Variance and Covariance Estimation under Differential Privacy in the Add-Remove Model and Beyond
by: Takakura, Shokichi, et al.
Published: (2025)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
by: Sakaue, Shinsaku, et al.
Published: (2026)

Optimal Dimension-Free Sampling for Regularized Classification
by: Alishahi, Meysam, et al.
Published: (2026)

Metalearning with Very Few Samples Per Task
by: Aliakbarpour, Maryam, et al.
Published: (2023)