Imagen de Portada

Misalignment, Learning, and Ranking: Harnessing Users Limited Attention

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Agarwal, Arpit, Niazadeh, Rad, Patil, Prathamesh
Formato:	Preprint
Publicado:	2024
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

Robust Dynamic Staffing with Predictions
por: Feng, Yiding, et al.
Publicado: (2025)

Semi-Bandit Learning for Monotone Stochastic Optimization
por: Agarwal, Arpit, et al.
Publicado: (2023)

Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
por: Darmasubramanian, Kailash Gopal, et al.
Publicado: (2025)

Near-Optimal Bayesian Online Assortment of Reusable Resources
por: Feng, Yiding, et al.
Publicado: (2025)

Learning-augmented Maximum Independent Set
por: Braverman, Vladimir, et al.
Publicado: (2024)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
por: Agarwal, Arpit, et al.
Publicado: (2024)

Learning-Augmented Dynamic Submodular Maximization
por: Agarwal, Arpit, et al.
Publicado: (2023)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
por: Braverman, Vladimir, et al.
Publicado: (2024)

Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement
por: Bansak, Kirk, et al.
Publicado: (2024)

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

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

Online Resource Allocation with Cancellations
por: Ekbatani, Farbod, et al.
Publicado: (2022)

Robustness of Online Inventory Balancing to Inventory Shocks
por: Feng, Yiding, et al.
Publicado: (2025)

Reweighted Solutions for Weighted Low Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2024)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
por: Kannan, Ravindran, et al.
Publicado: (2024)

Generalized Top-k Mallows Model for Ranked Choices
por: Haddadan, Shahrzad, et al.
Publicado: (2025)

Online Prediction with Limited Selectivity
por: Liu, Licheng, et al.
Publicado: (2025)

On Socially Fair Low-Rank Approximation and Column Subset Selection
por: Song, Zhao, et al.
Publicado: (2024)

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

Top-k on a Budget: Adaptive Ranking with Weak and Strong Oracles
por: Oettershagen, Lutz
Publicado: (2026)

Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications
por: Zhou, Fengqin
Publicado: (2025)

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

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
por: Garg, Sachin, et al.
Publicado: (2025)

$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers
por: Haris, Themistoklis
Publicado: (2024)

Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
por: Wolfson, Daniel, et al.
Publicado: (2026)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
por: Alman, Josh, et al.
Publicado: (2025)

Prophet Inequalities with Cancellation Costs
por: Ekbatani, Farbod, et al.
Publicado: (2024)

Online Job Assignment
por: Ekbatani, Farbod, et al.
Publicado: (2025)

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

Provably Learning from Modern Language Models via Low Logit Rank
por: Golowich, Noah, et al.
Publicado: (2025)

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

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

Learned LSM-trees: Two Approaches Using Learned Bloom Filters
por: Fidalgo, Nicholas, et al.
Publicado: (2025)

Active Learning with Simple Questions
por: Kontonis, Vasilis, et al.
Publicado: (2024)

Robust Learning-Augmented Dictionaries
por: Zeynali, Ali, et al.
Publicado: (2024)

Learning with Monotone Adversarial Corruptions
por: Larsen, Kasper Green, et al.
Publicado: (2026)

Testable Learning with Distribution Shift
por: Klivans, Adam R., et al.
Publicado: (2023)

Learning the Positions in CountSketch
por: Li, Yi, et al.
Publicado: (2023)

Learning Low Degree Hypergraphs
por: Balkanski, Eric, et al.
Publicado: (2022)

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