Imagen de Portada

Online Linear Regression with Paid Stochastic Features

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Merlis, Nadav, Jang, Kyoungseok, Cesa-Bianchi, Nicolò
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
por: Jin, Tianyuan, et al.
Publicado: (2024)

Distributed Online Optimization with Stochastic Agent Availability
por: Achddou, Juliette, et al.
Publicado: (2024)

Reinforcement Learning with Lookahead Information
por: Merlis, Nadav
Publicado: (2024)

Reinforcement Learning with Multi-Step Lookahead Information Via Adaptive Batching
por: Merlis, Nadav
Publicado: (2026)

Multitask Online Learning: Listen to the Neighborhood Buzz
por: Achddou, Juliette, et al.
Publicado: (2023)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
por: Esposito, Emmanuel, et al.
Publicado: (2022)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
por: Di Gennaro, Federico, et al.
Publicado: (2025)

Cooperative Online Learning with Feedback Graphs
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2021)

Beyond Bandit Feedback in Online Multiclass Classification
por: van der Hoeven, Dirk, et al.
Publicado: (2021)

A Perturbation Approach to Unconstrained Linear Bandits
por: Jacobsen, Andrew, et al.
Publicado: (2026)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
por: Zhao, Yuheng, et al.
Publicado: (2026)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
por: Rumi, Alberto, et al.
Publicado: (2026)

Fair Online Bilateral Trade
por: Bachoc, François, et al.
Publicado: (2024)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
por: Kuroki, Yuko, et al.
Publicado: (2023)

Online Budget Allocation with Censored Semi-Bandit Feedback
por: Bachoc, François, et al.
Publicado: (2025)

Lookahead identification in adversarial bandits: accuracy and memory bounds
por: Brukhim, Nataly, et al.
Publicado: (2026)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
por: Qiu, Hao, et al.
Publicado: (2026)

The Value of Reward Lookahead in Reinforcement Learning
por: Merlis, Nadav, et al.
Publicado: (2024)

Adaptive maximization of social welfare
por: Cesa-Bianchi, Nicolo, et al.
Publicado: (2023)

Dynamic Regret Reduces to Kernelized Static Regret
por: Jacobsen, Andrew, et al.
Publicado: (2025)

Improved Regret Bounds for Bandits with Expert Advice
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2024)

Stability and Generalization for Bellman Residuals
por: Kang, Enoch H., et al.
Publicado: (2025)

On Bits and Bandits: Quantifying the Regret-Information Trade-off
por: Shufaro, Itai, et al.
Publicado: (2024)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
por: Eldowa, Khaled, et al.
Publicado: (2024)

Rate-optimal Design for Anytime Best Arm Identification
por: Komiyama, Junpei, et al.
Publicado: (2025)

Fixed Confidence Best Arm Identification in the Bayesian Setting
por: Jang, Kyoungseok, et al.
Publicado: (2024)

Adaptive Bandit Algorithms for Contextual Matching Markets
por: Lin, Shiyun, et al.
Publicado: (2026)

Stable Matching with Ties: Approximation Ratios and Learning
por: Lin, Shiyun, et al.
Publicado: (2024)

On the Hardness of Reinforcement Learning with Transition Look-Ahead
por: Pla, Corentin, et al.
Publicado: (2025)

Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
por: Jang, Kyoungseok, et al.
Publicado: (2024)

GL-LowPopArt: A Nearly Instance-Wise Minimax-Optimal Estimator for Generalized Low-Rank Trace Regression
por: Lee, Junghyun, et al.
Publicado: (2025)

A Regret Analysis of Bilateral Trade
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2021)

Improved Algorithms for Contextual Dynamic Pricing
por: Tullii, Matilde, et al.
Publicado: (2024)

A Theory of Interpretable Approximations
por: Bressan, Marco, et al.
Publicado: (2024)

Of Dice and Games: A Theory of Generalized Boosting
por: Bressan, Marco, et al.
Publicado: (2024)

Learning Conditional Averages
por: Bressan, Marco, et al.
Publicado: (2026)

The Invisible Handshake: Persistent Overpricing by Adaptive Market Agents
por: Foscari, Luigi, et al.
Publicado: (2025)

Repeated Bilateral Trade Against a Smoothed Adversary
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

Market Making without Regret
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)