Saved in:
| Main Authors: | Bai, Yannan, Panigrahi, Debmalya, Zhang, Ian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.15319 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026)
by: Hebbar, Anish, et al.
Published: (2026)
Characterizing the Effect of Noise in Language Generation in the Limit
by: Li, Aaron, et al.
Published: (2026)
by: Li, Aaron, et al.
Published: (2026)
Nearly Tight Bounds for the Online Sorting Problem
by: Azar, Yossi, et al.
Published: (2025)
by: Azar, Yossi, et al.
Published: (2025)
Network Unreliability in Almost-Linear Time
by: Cen, Ruoxu, et al.
Published: (2025)
by: Cen, Ruoxu, et al.
Published: (2025)
Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
by: Bhattacharya, Sayan, et al.
Published: (2025)
by: Bhattacharya, Sayan, et al.
Published: (2025)
Hypergraph Unreliability in Quasi-Polynomial Time
by: Cen, Ruoxu, et al.
Published: (2024)
by: Cen, Ruoxu, et al.
Published: (2024)
Testable Learning of General Halfspaces under Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2026)
by: Diakonikolas, Ilias, et al.
Published: (2026)
Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)
by: Diakonikolas, Ilias, et al.
Published: (2024)
Linear Submodular Maximization with Bandit Feedback
by: Chen, Wenjing, et al.
Published: (2024)
by: Chen, Wenjing, et al.
Published: (2024)
Testing Noise Assumptions of Learning Algorithms
by: Goel, Surbhi, et al.
Published: (2025)
by: Goel, Surbhi, et al.
Published: (2025)
Fast Algorithms for Graph Arboricity and Related Problems
by: Cen, Ruoxu, et al.
Published: (2025)
by: Cen, Ruoxu, et al.
Published: (2025)
The Space Complexity of Approximating Logistic Loss
by: Dexter, Gregory, et al.
Published: (2024)
by: Dexter, Gregory, et al.
Published: (2024)
Language Generation in the Limit
by: Kleinberg, Jon, et al.
Published: (2024)
by: Kleinberg, Jon, et al.
Published: (2024)
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)
by: Esposito, Emmanuel, et al.
Published: (2022)
Stochastic $k$-Submodular Bandits with Full Bandit Feedback
by: Nie, Guanyu, et al.
Published: (2024)
by: Nie, Guanyu, et al.
Published: (2024)
Mistake-Bounded Language Generation
by: Kleinberg, Jon, et al.
Published: (2026)
by: Kleinberg, Jon, et al.
Published: (2026)
Online Prediction with Limited Selectivity
by: Liu, Licheng, et al.
Published: (2025)
by: Liu, Licheng, et al.
Published: (2025)
Near-optimal Swap Regret Minimization for Convex Losses
by: Hu, Lunjia, et al.
Published: (2026)
by: Hu, Lunjia, et al.
Published: (2026)
Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate
by: Shen, Jie
Published: (2024)
by: Shen, Jie
Published: (2024)
Limitations of Membership Queries in Testable Learning
by: Lange, Jane, et al.
Published: (2025)
by: Lange, Jane, et al.
Published: (2025)
Online Algorithms with Limited Data Retention
by: Immorlica, Nicole, et al.
Published: (2024)
by: Immorlica, Nicole, et al.
Published: (2024)
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
by: Nguyen, Tuan-Anh, et al.
Published: (2024)
by: Nguyen, Tuan-Anh, et al.
Published: (2024)
Online Learning with Limited Information in the Sliding Window Model
by: Braverman, Vladimir, et al.
Published: (2026)
by: Braverman, Vladimir, et al.
Published: (2026)
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
by: Agarwal, Arpit, et al.
Published: (2024)
by: Agarwal, Arpit, et al.
Published: (2024)
Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
by: Zeng, Shiwei, et al.
Published: (2023)
by: Zeng, Shiwei, et al.
Published: (2023)
On Language Generation in the Limit with Bounded Memory
by: Kleinberg, Jon, et al.
Published: (2026)
by: Kleinberg, Jon, et al.
Published: (2026)
Exploring Facets of Language Generation in the Limit
by: Charikar, Moses, et al.
Published: (2024)
by: Charikar, Moses, et al.
Published: (2024)
From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
by: Sakaue, Shinsaku, et al.
Published: (2026)
by: Sakaue, Shinsaku, et al.
Published: (2026)
Differentially Private Language Generation and Identification in the Limit
by: Mehrotra, Anay, et al.
Published: (2026)
by: Mehrotra, Anay, et al.
Published: (2026)
Average Sensitivity of Hierarchical $k$-Median Clustering
by: Li, Shijie, et al.
Published: (2025)
by: Li, Shijie, et al.
Published: (2025)
Coresets for Clustering Under Stochastic Noise
by: Huang, Lingxiao, et al.
Published: (2025)
by: Huang, Lingxiao, et al.
Published: (2025)
On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse
by: Kalavasis, Alkis, et al.
Published: (2024)
by: Kalavasis, Alkis, et al.
Published: (2024)
Online Learning of Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)
by: Diakonikolas, Ilias, et al.
Published: (2024)
Complexity of Local Search for CSPs Parameterized by Constraint Difference
by: Anand, Aditya, et al.
Published: (2025)
by: Anand, Aditya, et al.
Published: (2025)
Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
by: Zhang, Hongyang R., et al.
Published: (2023)
by: Zhang, Hongyang R., et al.
Published: (2023)
Deterministic Almost-Linear-Time Gomory-Hu Trees
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Learning Constant-Depth Circuits in Malicious Noise Models
by: Klivans, Adam R., et al.
Published: (2024)
by: Klivans, Adam R., et al.
Published: (2024)
Generalized Top-k Mallows Model for Ranked Choices
by: Haddadan, Shahrzad, et al.
Published: (2025)
by: Haddadan, Shahrzad, et al.
Published: (2025)
Contrastive Identification and Generation in the Limit
by: Li, Xiaoyu, et al.
Published: (2026)
by: Li, Xiaoyu, et al.
Published: (2026)
Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)
by: Pedramfar, Mohammad, et al.
Published: (2023)
Similar Items
-
Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026) -
Characterizing the Effect of Noise in Language Generation in the Limit
by: Li, Aaron, et al.
Published: (2026) -
Nearly Tight Bounds for the Online Sorting Problem
by: Azar, Yossi, et al.
Published: (2025) -
Network Unreliability in Almost-Linear Time
by: Cen, Ruoxu, et al.
Published: (2025) -
Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
by: Bhattacharya, Sayan, et al.
Published: (2025)