Cover Image

Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vahidi, Soroush, Koutis, Ioannis
Format:	Preprint
Published:	2024
Subjects:	Information Retrieval Artificial Intelligence Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exploration Space Theory: Formal Foundations for Prerequisite-Aware Location-Based Recommendation
by: Sadallah, Madjid
Published: (2026)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
by: Bruch, Sebastian, et al.
Published: (2025)

Assortment Planning with Sponsored Products
by: Tang, Shaojie, et al.
Published: (2024)

Privacy-Preserving Learning-Augmented Data Structures
by: Goyal, Prabhav, et al.
Published: (2025)

A Bi-metric Framework for Fast Similarity Search
by: Xu, Haike, et al.
Published: (2024)

Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)

REWA: A General Theory of Witness-Based Similarity
by: Phadke, Nikit
Published: (2025)

Constant-Factor Approximation for the Uniform Decision Tree
by: Szyfelbein, Michał
Published: (2026)

The Information Theory of Similarity
by: Phadke, Nikit
Published: (2025)

Retrieval with Learned Similarities
by: Ding, Bailu, et al.
Published: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)

Model-Free Counterfactual Subset Selection at Scale
by: Nguyen, Minh Hieu, et al.
Published: (2025)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
by: Armenante, Pietro, et al.
Published: (2025)

On Computing Top-$k$ Simple Shortest Paths from a Single Source
by: D'Emidio, Mattia, et al.
Published: (2025)

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

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

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)

Best Agent Identification for General Game Playing
by: Stephenson, Matthew, et al.
Published: (2025)

New Algorithmic Directions in Optimal Transport and Applications for Product Spaces
by: Beigi, Salman, et al.
Published: (2025)

Foundations of Vector Retrieval
by: Bruch, Sebastian
Published: (2024)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

An Effective Tag Assignment Approach for Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2024)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
by: Lebeda, Christian Janos, et al.
Published: (2024)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
by: Petrov, Aleksandr V., et al.
Published: (2024)

On the LSH Distortion of Ulam and Cayley Similarities
by: Chierichetti, Flavio, et al.
Published: (2026)

Fast and exact fixed-radius neighbor search based on sorting
by: Chen, Xinye, et al.
Published: (2022)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
by: Wang, Honglian, et al.
Published: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
by: Wu, Wei, et al.
Published: (2022)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
by: Byriukov, Stanislav
Published: (2026)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
by: Faro, Simone, et al.
Published: (2025)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

On Unbiased Low-Rank Approximation with Minimum Distortion
by: Barnes, Leighton Pate, et al.
Published: (2025)

Results of the Big ANN: NeurIPS'23 competition
by: Simhadri, Harsha Vardhan, et al.
Published: (2024)

Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data
by: Li, Xiaoyu, et al.
Published: (2025)

Chamfer-Linkage for Hierarchical Agglomerative Clustering
by: Gowda, Kishen N, et al.
Published: (2026)

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
by: Hashemi, Mohammad, et al.
Published: (2024)