Image de couverture de livre

Complexity as Advantage: A Regret-Based Perspective on Emergent Structure

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Naparstek, Oshri
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Projected Autoregression: Autoregressive Language Generation in Continuous State Space
par: Naparstek, Oshri
Publié: (2026)

Is the Modality Gap a Bug or a Feature? A Robustness Perspective
par: Chowers, Rhea, et autres
Publié: (2026)

On the Regret of Coded Caching with Adversarial Requests
par: Nayak, Anupam, et autres
Publié: (2024)

Best Arm Identification with Minimal Regret
par: Yang, Junwen, et autres
Publié: (2024)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
par: Bondaschi, Marco, et autres
Publié: (2025)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
par: Li, Zihan, et autres
Publié: (2022)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
par: Tajdini, Artin, et autres
Publié: (2025)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
par: Frey, Matthias, et autres
Publié: (2026)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
par: Panda, Subhodip, et autres
Publié: (2026)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
par: Jia, Zeyu, et autres
Publié: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
par: Bongole, Raghav, et autres
Publié: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
par: Yang, Junwen, et autres
Publié: (2024)

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces
par: Tran-The, Hung, et autres
Publié: (2020)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
par: Shah, Mohammad Taha, et autres
Publié: (2025)

Measuring the Predictability of Recommender Systems using Structural Complexity Metrics
par: Abeliuk, Andrés, et autres
Publié: (2024)

Tight Regret Bounds for Bayesian Optimization in One Dimension
par: Scarlett, Jonathan
Publié: (2018)

Information-Theoretic Progress Measures reveal Grokking is an Emergent Phase Transition
par: Clauw, Kenzo, et autres
Publié: (2024)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
par: Azize, Achraf, et autres
Publié: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
par: Zamir, Guy, et autres
Publié: (2026)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
par: Hou, Yunlong, et autres
Publié: (2026)

Semantic Communication meets System 2 ML: How Abstraction, Compositionality and Emergent Languages Shape Intelligence
par: Bennis, Mehdi, et autres
Publié: (2025)

Minimizing Queue Length Regret for Arbitrarily Varying Channels
par: Krishnakumar, G, et autres
Publié: (2025)

No-Regret Bayesian Recommendation to Homogeneous Users
par: Feng, Yiding, et autres
Publié: (2022)

Provable Privacy Advantages of Decentralized Federated Learning via Distributed Optimization
par: Yu, Wenrui, et autres
Publié: (2024)

Generalizing Supervised Contrastive learning: A Projection Perspective
par: Jeong, Minoh, et autres
Publié: (2025)

Information Theoretic Perspective on Representation Learning
par: Pereg, Deborah, et autres
Publié: (2026)

An Information Theoretic Perspective on Conformal Prediction
par: Correia, Alvaro H. C., et autres
Publié: (2024)

Compression, Regularity, Randomness and Emergent Structure: Rethinking Physical Complexity in the Data-Driven Era
par: Dehghani, Nima
Publié: (2025)

Learning from Acceptance: Cumulative Regret in the Game of Coding
par: Nodehi, Hanzaleh Akbari, et autres
Publié: (2026)

Neural Weight Norm = Kolmogorov Complexity
par: Musat, Tiberiu
Publié: (2026)

Unified Error Correction Code Transformer with Low Complexity
par: Yan, Yongli, et autres
Publié: (2024)

Clustering Change Sign Detection by Fusing Mixture Complexity
par: Urano, Kento, et autres
Publié: (2024)

Structured IB: Improving Information Bottleneck with Structured Feature Learning
par: Yang, Hanzhe, et autres
Publié: (2024)

On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective
par: Dong, Zhiyi, et autres
Publié: (2025)

Analyzing Multimodal Integration in the Variational Autoencoder from an Information-Theoretic Perspective
par: Langer, Carlotta, et autres
Publié: (2024)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
par: Li, Gen, et autres
Publié: (2022)

The Sample Complexity of Simple Binary Hypothesis Testing
par: Pensia, Ankit, et autres
Publié: (2024)

On the Sample Complexity of Robust Binary Hypothesis Testing
par: Vallinayagam, Shankar, et autres
Publié: (2026)

Span-Based Optimal Sample Complexity for Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2023)

Heterogeneity Matters even More in Distributed Learning: Study from Generalization Perspective
par: Kavian, Masoud, et autres
Publié: (2025)