Image de couverture de livre

Sample-Efficient Agnostic Boosting

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ghai, Udaya, Singh, Karan
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sample-Optimal Agnostic Boosting with Unlabeled Data
par: Ghai, Udaya, et autres
Publié: (2025)

How Does Critical Batch Size Scale in Pre-training?
par: Zhang, Hanlin, et autres
Publié: (2024)

Introduction to Online Control
par: Hazan, Elad, et autres
Publié: (2022)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
par: Sherman, Uri, et autres
Publié: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
par: Zurek, Matthew, et autres
Publié: (2025)

Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting
par: Ustimenko, Aleksei, et autres
Publié: (2023)

Exploiting Exogenous Structure for Sample-Efficient Reinforcement Learning
par: Wan, Jia, et autres
Publié: (2024)

Sample Efficient Reinforcement Learning with Partial Dynamics Knowledge
par: Alharbi, Meshal, et autres
Publié: (2023)

Sample-Efficient Reinforcement Learning of Koopman eNMPC
par: Mayfrank, Daniel, et autres
Publié: (2025)

Improved Convergence in Parameter-Agnostic Error Feedback through Momentum
par: Sadiev, Abdurakhmon, et autres
Publié: (2025)

Pareto Front Shape-Agnostic Pareto Set Learning in Multi-Objective Optimization
par: Ye, Rongguang, et autres
Publié: (2024)

Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning
par: Zhan, Donglin, et autres
Publié: (2025)

TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization
par: Sorokin, D., et autres
Publié: (2023)

Gradient Regularized Newton Boosting Trees with Global Convergence
par: Zozoulenko, Nikita, et autres
Publié: (2026)

Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL
par: Yang, Tong, et autres
Publié: (2025)

Replicable Bandits with UCB based Exploration
par: Deb, Rohan, et autres
Publié: (2026)

Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles
par: Emine, Youssouf, et autres
Publié: (2024)

FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling
par: Chen, Cheng, et autres
Publié: (2020)

Proximal Oracles for Optimization and Sampling
par: Liang, Jiaming, et autres
Publié: (2024)

Optimization Landscapes Learned: Proxy Networks Boost Convergence in Physics-based Inverse Problems
par: Goyal, Girnar, et autres
Publié: (2025)

Progressively Sampled Equality-Constrained Optimization
par: Curtis, Frank E., et autres
Publié: (2025)

Latent Guided Sampling for Combinatorial Optimization
par: Surendran, Sobihan, et autres
Publié: (2025)

Boosting Column Generation with Graph Neural Networks for Joint Rider Trip Planning and Crew Shift Scheduling
par: Lu, Jiawei, et autres
Publié: (2024)

BOOOM: Loss-Function-Agnostic Black-Box Optimization over Orthonormal Manifolds for Machine Learning and Statistical Inference
par: Kim, Beomchang, et autres
Publié: (2026)

Finite Sample Frequency Domain Identification
par: Tsiamis, Anastasios, et autres
Publié: (2024)

Gaussian Process Thompson Sampling via Rootfinding
par: Adebiyi, Taiwo A., et autres
Publié: (2024)

Epsilon-Greedy Thompson Sampling to Bayesian Optimization
par: Do, Bach, et autres
Publié: (2024)

Sample Complexity of Stochastic Optimization with Integer Variables
par: Cheng, Hongyu, et autres
Publié: (2026)

Multi-Armed Sampling Problem and the End of Exploration
par: Pedramfar, Mohammad, et autres
Publié: (2025)

When Machine Learning Meets Importance Sampling: A More Efficient Rare Event Estimation Approach
par: Zhao, Ruoning, et autres
Publié: (2025)

OTAD: An Optimal Transport-Induced Robust Model for Agnostic Adversarial Attack
par: Gai, Kuo, et autres
Publié: (2024)

Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise
par: Kanakeri, Vinay, et autres
Publié: (2025)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
par: Li, Xuheng, et autres
Publié: (2024)

Constrained Sampling with Primal-Dual Langevin Monte Carlo
par: Chamon, Luiz F. O., et autres
Publié: (2024)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
par: Livni, Roi
Publié: (2024)

Optimizing Posterior Samples for Bayesian Optimization via Rootfinding
par: Adebiyi, Taiwo A., et autres
Publié: (2024)

Practical Bayesian Algorithm Execution via Posterior Sampling
par: Cheng, Chu Xin, et autres
Publié: (2024)

Group Distributionally Robust Optimization with Flexible Sample Queries
par: Bai, Haomin, et autres
Publié: (2025)

Robust and Fast Training via Per-Sample Clipping
par: Nobile, Davide, et autres
Publié: (2026)

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization
par: Li, Muheng, et autres
Publié: (2025)