Imagen de Portada

Online Prediction with Limited Selectivity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Licheng, Qiao, Mingda
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Limitations of Membership Queries in Testable Learning
por: Lange, Jane, et al.
Publicado: (2025)

On the Distance from Calibration in Sequential Prediction
por: Qiao, Mingda, et al.
Publicado: (2024)

Computational and Statistical Hardness of Calibration Distance
por: Qiao, Mingda
Publicado: (2026)

Collaborative Learning with Different Labeling Functions
por: Deng, Yuyang, et al.
Publicado: (2024)

Sample-Adaptivity Tradeoff in On-Demand Sampling
por: Haghtalab, Nika, et al.
Publicado: (2025)

Truthfulness of Calibration Measures
por: Haghtalab, Nika, et al.
Publicado: (2024)

Online Algorithms with Limited Data Retention
por: Immorlica, Nicole, et al.
Publicado: (2024)

Online Classification with Predictions
por: Raman, Vinod, et al.
Publicado: (2024)

Online Learning with Limited Information in the Sliding Window Model
por: Braverman, Vladimir, et al.
Publicado: (2026)

Online Algorithms with Uncertainty-Quantified Predictions
por: Sun, Bo, et al.
Publicado: (2023)

Online Multi-Class Selection with Group Fairness Guarantee
por: Zargari, Faraz, et al.
Publicado: (2025)

Improving Online Algorithms via ML Predictions
por: Kumar, Ravi, et al.
Publicado: (2024)

Improved Bounds for Online Facility Location with Predictions
por: Fotakis, Dimitris, et al.
Publicado: (2021)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
por: Lee, Russell, et al.
Publicado: (2022)

Optimal $k$-Secretary with Logarithmic Memory
por: Qiao, Mingda, et al.
Publicado: (2025)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
por: Zhang, Keyuan, et al.
Publicado: (2024)

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

Online Learning in the Random Order Model
por: Bernasconi, Martino, et al.
Publicado: (2025)

Online Two-Stage Submodular Maximization
por: Nikolaou, Iasonas, et al.
Publicado: (2025)

Transductive and Learning-Augmented Online Regression
por: Raman, Vinod, et al.
Publicado: (2025)

Online Weighted Paging with Unknown Weights
por: Levy, Orin, et al.
Publicado: (2024)

Language Generation in the Limit: Noise, Loss, and Feedback
por: Bai, Yannan, et al.
Publicado: (2025)

Online Sparsification of Bipartite-Like Clusters in Graphs
por: Das, Joyentanuj, et al.
Publicado: (2025)

Parsimonious Learning-Augmented Online Metric Matching
por: Shin, Yongho, et al.
Publicado: (2026)

Learning-Augmented Online Scheduling with Parsimonious Preemption
por: Blue, Mugen, et al.
Publicado: (2026)

Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
por: Agarwal, Arpit, et al.
Publicado: (2024)

Online Conformal Prediction with Efficiency Guarantees
por: Srinivas, Vaidehi
Publicado: (2025)

Online Learning with Probing for Sequential User-Centric Selection
por: Xu, Tianyi, et al.
Publicado: (2025)

Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
por: Ghuge, Rohan, et al.
Publicado: (2025)

Private List Learnability vs. Online List Learnability
por: Hanneke, Steve, et al.
Publicado: (2025)

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

Sublinear Time Algorithm for Online Weighted Bipartite Matching
por: Hu, Hang, et al.
Publicado: (2022)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
por: Lechowicz, Adam, et al.
Publicado: (2023)

Learning-Augmented Algorithms for $k$-median via Online Learning
por: Hebbar, Anish, et al.
Publicado: (2026)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
por: John, Philips George, et al.
Publicado: (2024)

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
por: Harada, Tsubasa, et al.
Publicado: (2025)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
por: Burathep, Kunanon, et al.
Publicado: (2025)

An Approximation Algorithm for Graph Label Selection
por: John, Josia, et al.
Publicado: (2026)

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
por: Hayderi, Alexandre, et al.
Publicado: (2024)

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
por: Xu, Haoran, et al.
Publicado: (2026)