cs.LG

Papers

• Efficiently Learning at Test-Time: Active Fine-Tuning of LLMs (2025)
  Jonas H\"ubotter et al.
  11.85
• Valori: A Deterministic Memory Substrate for AI Systems (2025)
  Varshith Gudur
  8.42
• Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators (2026)
  Zhengyang Su et al.
  7.43
• LEANN: A Low-Storage Vector Index (2025)
  Yichuan Wang et al.
  6.88
• HetFS: A Method for Fast Similarity Search with Ad-hoc Meta-paths on Heterogeneous Information Networks (2025)
  Xuqi Mao et al.
  5.84
• CRINN: Contrastive Reinforcement Learning for Approximate Nearest Neighbor Search (2025)
  Xiaoya Li et al.
  5.67
• GENIUS: A Generative Framework for Universal Multimodal Search (2025)
  Sungyeon Kim et al.
  5.24
• DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees (2025)
  Alireza Heidari et al.
  4.52
• Eulerian Gaussian Splatting using Hashed Probability Pyramids (2026)
  Mia Gaia Polansky et al.
  3.91
• The Bridge-Garden Dilemma in LLM Distillation: Why Mixing Hard and Soft Labels Works (2026)
  Guanghui Wang et al.
  3.10
• Lightweight Complementary-Cue Fusion for Robust Video Face Forgery Detection (2026)
  Sunghwan Baek et al.
  3.10
• Reducing Experimental Testing in Space Propulsion Film Cooling Analyses by Pixelwise Generative Image Interpolation (2026)
  Adam T. M\"uller et al.
  3.10
• A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNs (2026)
  Kiran Purohit et al.
  0.00
• On Storage Neural Network Augmented Approximate Nearest Neighbor Search (2025)
  Taiga Ikeda et al.
  0.00
• QLESS: A Quantized Approach for Data Valuation and Selection in Large Language Model Fine-Tuning (2025)
  Moses Ananta et al.
  0.00
• Hierarchical Retrieval at Scale: Bridging Transparency and Efficiency (2026)
  Shubham Gupta and Zichao Li and Tianyi Chen and Cem Subakan and Siva Reddy and Perouz Taslakian and Valentina Zantedeschi
  0.00
• Almost Linear Time Consistent Mode Estimation and Quick Shift Clustering (2025)
  Sajjad Hashemian
  0.00
• Finding DoRI: Discovery of Retained Images in Diffusion Models (2026)
  Antoni Kowalczuk et al.
  0.00
• Beyond Nearest Neighbors: Semantic Compression and Graph-Augmented Retrieval for Enhanced Vector Search (2025)
  Rahul Raja et al.
  0.00
• Modality Alignment across Trees on Heterogeneous Hyperbolic Manifolds (2026)
  Wei Wu et al.
  0.00
• kNN-Graph: An adaptive graph model for $k$-nearest neighbors (2026)
  Jiaye Li et al.
  0.00
• GauS: Differentiable Scheduling Optimization via Gaussian Reparameterization (2026)
  Yaohui Cai et al.
  0.00
• An ensemble diversity approach to supervised binary hashing (2016)
  Miguel \'A. Carreira-Perpi\~n\'an and Ramin Raziperchikolaei
  —
• Efficient approaches for escaping higher order saddle points in non-convex optimization (2016)
  Anima Anandkumar et al.
  —
• 2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search (2016)
  Ping Li et al.
  —
• Auto-JacoBin: Auto-encoder Jacobian Binary Hashing (2016)
  Xiping Fu et al.
  —
• Scalable and Sustainable Deep Learning via Randomized Hashing (2016)
  Ryan Spring et al.
  —
• CMA-ES for Hyperparameter Optimization of Deep Neural Networks (2016)
  Ilya Loshchilov and Frank Hutter
  —
• Geometry Aware Mappings for High Dimensional Sparse Factors (2016)
  Avradeep Bhowmik et al.
  —
• Active Learning On Weighted Graphs Using Adaptive And Non-adaptive Approaches (2016)
  Eyal En Gad et al.
  —
• Efficient Document Indexing Using Pivot Tree (2016)
  Gaurav Singh and Benjamin Piwowarski
  —
• Computing Web-scale Topic Models using an Asynchronous Parameter Server (2017)
  Rolf Jagerman et al.
  —
• Efficient Estimation of k for the Nearest Neighbors Class of Methods (2016)
  Aleksander Lodwich et al.
  —
• Learning a metric for class-conditional KNN (2016)
  Daniel Jiwoong Im et al.
  —
• Theory of the GMM Kernel (2016)
  Ping Li and Cun-Hui Zhang
  —
• Content-based image retrieval tutorial (2016)
  Joani Mitro
  —
• Distributed Probabilistic Bisection Search using Social Learning (2016)
  Athanasios Tsiligkaridis and Theodoros Tsiligkaridis
  —
• Random Forest for Label Ranking (2018)
  Yangming Zhou and Guoping Qiu
  —
• Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation (2016)
  Weihao Gao and Sewoong Oh and Pramod Viswanath
  —
• ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings (2016)
  Jaros{\l}aw B{\l}asiok et al.
  —
• Large Margin Nearest Neighbor Classification using Curved Mahalanobis Distances (2016)
  Frank Nielsen and Boris Muzellec and Richard Nock
  —
• The Famine of Forte: Few Search Problems Greatly Favor Your Algorithm (2017)
  George D. Montanez
  —
• Fast Cosine Similarity Search in Binary Space with Angular Multi-index Hashing (2018)
  Sepehr Eghbali and Ladan Tahvildari
  —
• Boost K-Means (2016)
  Wan-Lei Zhao et al.
  —
• A Greedy Approach for Budgeted Maximum Inner Product Search (2016)
  Hsiang-Fu Yu et al.
  —
• Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information Networks (2016)
  Jingbo Shang et al.
  —
• Multidimensional Binary Search for Contextual Decision-Making (2017)
  Ilan Lobel et al.
  —
• Fast Supervised Discrete Hashing and its Analysis (2016)
  Gou Koutaki et al.
  —
• Generalized Intersection Kernel (2016)
  Ping Li
  —
• Stochastic Generative Hashing (2017)
  Bo Dai et al.
  —