Copertina

Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Xiaoyu, Song, Zhao, Zhang, Jiahao
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Computers and Society Digital Libraries Information Retrieval Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Error-Tolerant E-Discovery Protocols
di: Dong, Jinshuo, et al.
Pubblicazione: (2024)

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

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

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
di: Hussain, Md Taufique, et al.
Pubblicazione: (2024)

A greedy approach for increased vehicle utilization in ridesharing networks
di: Makhdomi, Aqsa Ashraf, et al.
Pubblicazione: (2023)

Foundations of Vector Retrieval
di: Bruch, Sebastian
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

Linked Array Tree: A Constant-Time Search Structure for Big Data
di: Liu, Songpeng
Pubblicazione: (2025)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
di: Zhao, Fuheng, et al.
Pubblicazione: (2023)

Dimensionality Reduced Clustered Data and Order Partition and Stepwise Dimensionality Increasing Indices
di: Thomasian, Alexander
Pubblicazione: (2024)

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

Efficiently Constructing Sparse Navigable Graphs
di: Conway, Alex, et al.
Pubblicazione: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
di: Tabei, Yasuo
Pubblicazione: (2025)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
di: Li, Hui, et al.
Pubblicazione: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
di: Coleman, Benjamin, et al.
Pubblicazione: (2023)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
di: Iff, Patrick, et al.
Pubblicazione: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
di: Shi, Jifan, et al.
Pubblicazione: (2026)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
di: Huang, Qiang, et al.
Pubblicazione: (2024)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
di: Xu, Yuexuan, et al.
Pubblicazione: (2024)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
di: Pan, Yunjie, et al.
Pubblicazione: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
di: Santos, Aécio, et al.
Pubblicazione: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

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

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

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
di: Borchmann, Łukasz, et al.
Pubblicazione: (2020)

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