:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Daniely, Amit, Mehalel, Idan, Mossel, Elchanan
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.09167
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Realizable Regression and Applications for ReLU Networks
by: Doron-Arad, Ilan, et al.
Published: (2026)

A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning
by: Doron-Arad, Ilan, et al.
Published: (2026)

Most Convolutional Networks Suffer from Small Adversarial Perturbations
by: Daniely, Amit, et al.
Published: (2026)

A Mathematical Model for Curriculum Learning for Parities
by: Cornacchia, Elisabetta, et al.
Published: (2023)

Deep Networks Learn Deep Hierarchical Models
by: Daniely, Amit
Published: (2026)

Why ReLU? A Bit-Model Dichotomy for Deep Network Training
by: Doron-Arad, Ilan, et al.
Published: (2026)

Deterministic Apple Tasting
by: Chase, Zachary, et al.
Published: (2024)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
by: Li, Rupert, et al.
Published: (2025)

Some Theoretical Limitations of t-SNE
by: Li, Rupert, et al.
Published: (2026)

Existence of Adversarial Examples for Random Convolutional Networks via Isoperimetric Inequalities on $\mathbb{so}(d)$
by: Daniely, Amit
Published: (2025)

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
by: Filmus, Yuval, et al.
Published: (2024)

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently
by: Cornacchia, Elisabetta, et al.
Published: (2026)

Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)

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

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
by: Hanneke, Steve, et al.
Published: (2026)

Multiclass Online Learnability under Bandit Feedback
by: Raman, Ananth, et al.
Published: (2023)

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions
by: Cornacchia, Elisabetta, et al.
Published: (2025)

On the Sample Complexity of Two-Layer Networks: Lipschitz vs. Element-Wise Lipschitz Activation
by: Daniely, Amit, et al.
Published: (2022)

Denoising distances beyond the volumetric barrier
by: Huang, Han, et al.
Published: (2026)

Reconstructing the Geometry of Random Geometric Graphs
by: Huang, Han, et al.
Published: (2024)

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
by: Filmus, Yuval, et al.
Published: (2023)

Learning and Testing Convex Functions
by: Pinto Jr., Renato Ferreira, et al.
Published: (2025)

A Hierarchical Language Model with Predictable Scaling Laws and Provable Benefits of Reasoning
by: Gaitonde, Jason, et al.
Published: (2026)

RedEx: Beyond Fixed Representation Methods via Convex Optimization
by: Daniely, Amit, et al.
Published: (2024)

The Refutability Gap: Challenges in Validating Reasoning by Large Language Models
by: Mossel, Elchanan
Published: (2025)

Which Alert Removals are Beneficial?
by: Amit, Idan
Published: (2026)

Finding Super-spreaders in Network Cascades
by: Mossel, Elchanan, et al.
Published: (2024)

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
by: Attias, Idan, et al.
Published: (2026)

RL's Razor: Why Online Reinforcement Learning Forgets Less
by: Shenfeld, Idan, et al.
Published: (2025)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
by: Attias, Idan, et al.
Published: (2025)

Optimal sets of questions for Twenty Questions
by: Filmus, Yuval, et al.
Published: (2021)

A Large Scale Survey of Motivation in Software Development and Analysis of its Validity
by: Amit, Idan, et al.
Published: (2024)

Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs
by: Ryabchenko, Alexander, et al.
Published: (2025)

On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025)

Optimal Low degree hardness for Broadcasting on Trees
by: Huang, Han, et al.
Published: (2025)

Two Agents, One Prompt, and Your Weight
by: Mossel, Elchanan, et al.
Published: (2025)

Sharp Threshold for the Convergence of Nonstationary Averaging
by: Lepsveridze, Saba, et al.
Published: (2026)

Gaussian Broadcast on Grids
by: Jiradilok, Pakawut, et al.
Published: (2024)