Imagen de Portada

Generalized Top-k Mallows Model for Ranked Choices

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haddadan, Shahrzad, Ahmadian, Sara
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

Optimally Improving Cooperative Learning in a Social Setting
por: Haddadan, Shahrzad, et al.
Publicado: (2024)

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

The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\ell_2$ Norm Estimation
por: Ahmadian, Sara, et al.
Publicado: (2025)

Stochastic Matching via Local Sparsification
por: Ahmadian, Sara, et al.
Publicado: (2026)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
por: Fahrbach, Matthew, et al.
Publicado: (2024)

A Faster Generalized Two-Stage Approximate Top-K
por: Samaga, Yashas, et al.
Publicado: (2025)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
por: Ahmadian, Sara, et al.
Publicado: (2024)

Learning Augmented Graph $k$-Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

Incremental (k, z)-Clustering on Graphs
por: Cruciani, Emilio, et al.
Publicado: (2026)

Dynamic algorithms for k-center on graphs
por: Cruciani, Emilio, et al.
Publicado: (2023)

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

Average Sensitivity of Hierarchical $k$-Median Clustering
por: Li, Shijie, et al.
Publicado: (2025)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
por: Song, Shihong, et al.
Publicado: (2024)

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

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
por: Forster, Sebastian, et al.
Publicado: (2024)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
por: Nie, Guanyu, et al.
Publicado: (2024)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
por: Zhu, Yanhui, et al.
Publicado: (2024)

The Entropy and Crossentropy of Generalized Mallows Models
por: Meilă, Marina
Publicado: (2025)

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

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
por: Drexler, Lukas, et al.
Publicado: (2023)

Metric $k$-clustering using only Weak Comparison Oracles
por: Raychaudhury, Rahul, et al.
Publicado: (2026)

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

Dynamic Algorithm for Explainable k-medians Clustering under lp Norm
por: Makarychev, Konstantin, et al.
Publicado: (2025)

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

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
por: Zhang, Guangyi, et al.
Publicado: (2026)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2024)

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

Polynomial-time derivation of optimal k-tree topology from Markov networks
por: Dastjerdi, Fereshteh R., et al.
Publicado: (2024)

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

A New Rejection Sampling Approach to $k$-$\mathtt{means}$++ With Improved Trade-Offs
por: Shah, Poojan, et al.
Publicado: (2025)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
por: Cheng, Kangke, et al.
Publicado: (2026)

Model Stealing for Any Low-Rank Language Model
por: Liu, Allen, et al.
Publicado: (2024)

Generalizing Fair Top-$k$ Selection: An Integrative Approach
por: Cai, Guangya
Publicado: (2026)

Active Learning for Non-Parametric Choice Models
por: Susan, Fransisca, et al.
Publicado: (2022)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
por: Funk, Nicole, et al.
Publicado: (2026)

String Indexing for Top-$k$ Close Consecutive Occurrences
por: Bille, Philip, et al.
Publicado: (2020)

Mistake-Bounded Language Generation
por: Kleinberg, Jon, et al.
Publicado: (2026)

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