Experimental comparison of 15 HPO and NAS algorithms for automated feature preprocessing on 45 tabular datasets finds evolution-based methods and random search as top performers.
Agrawal, Tomas Karnagel, Sam Idicula, Sanjay Jinturkar, and Nipun Agarwal
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
PipeANN-Filter improves filtered vector search latency and throughput on SSD by exploring a superset of valid vectors identified via probabilistic filters and verifying attributes only after selecting top-k candidates.
FAVOR achieves 1.3-5x higher QPS at 95% Recall@10 for arbitrary filtered ANNS by combining exclusion-distance reshaping in HNSW graphs with a selectivity-driven router that switches between brute-force and optimized search.
Hermes enables constant-time global aggregations and in-place updates on homomorphically encrypted databases by embedding precomputed statistics in packed ciphertexts and using polynomial slot masking and shifting.
Relational engines achieve faster SQL+vector-search queries on GPU than CPU when using compact vector indexes and fast interconnects, reversing the CPU-only design in current systems.
This survey discusses key components and challenges for Personal LLM Agents and reviews solutions for their capability, efficiency, and security.
citing papers explorer
-
Auto-FP: An Experimental Study of Automated Feature Preprocessing for Tabular Data
Experimental comparison of 15 HPO and NAS algorithms for automated feature preprocessing on 45 tabular datasets finds evolution-based methods and random search as top performers.
-
PipeANN-Filter: An Efficient Filtered Vector Search System on SSD
PipeANN-Filter improves filtered vector search latency and throughput on SSD by exploring a superset of valid vectors identified via probabilistic filters and verifying attributes only after selecting top-k candidates.
-
FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
FAVOR achieves 1.3-5x higher QPS at 95% Recall@10 for arbitrary filtered ANNS by combining exclusion-distance reshaping in HNSW graphs with a selectivity-driven router that switches between brute-force and optimized search.
-
Hermes: Efficient Global Homomorphic Aggregation over Mutable Packed Ciphertexts
Hermes enables constant-time global aggregations and in-place updates on homomorphically encrypted databases by embedding precomputed statistics in packed ciphertexts and using polynomial slot masking and shifting.
-
To GPU or Not to GPU: Vector Search in Relational Engines
Relational engines achieve faster SQL+vector-search queries on GPU than CPU when using compact vector indexes and fast interconnects, reversing the CPU-only design in current systems.
-
Personal LLM Agents: Insights and Survey about the Capability, Efficiency and Security
This survey discusses key components and challenges for Personal LLM Agents and reviews solutions for their capability, efficiency, and security.