query complexity

Active Learning of Symbolic Automata over Rational Numbers AAAI 2026 Active Learning on Adversarially Corrupted Graphs COLT 2026 Actively Learning Halfspaces without Synthetic Data COLT 2026 Almost Linear Convergence under Minimal Score Assumptions: Quantized Transition Diffusion COLT 2026 A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions COLT 2026 High-Accuracy Log-Concave Sampling with Stochastic Queries COLT 2026 HotelQuEST: Balancing Quality and Efficiency in Agentic Search EACL 2026 Online and Offline Learning of Orderly Hypergraphs Using Queries ALT 2026 Optimal Reconstruction from Linear Queries COLT 2026 Query Efficient Structured Matrix Learning COLT 2026 Ranking Items from Discrete Ratings: The Cost of Unknown User Thresholds ALT 2026 A Formal Analysis of Chain-of-Thought Prompting via Turing Reductions IJCNLP 2025 Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation ICML 2025 Constant-Factor Distortion Mechanisms for k-Committee Election AAAI 2025 Distance Estimation for High-Dimensional Discrete Distributions AISTATS 2025 Firewall Routing: Blocking Leads to Better Hybrid Inference for LLMs EMNLP 2025 HyPA-RAG: A Hybrid Parameter Adaptive Retrieval-Augmented Generation System for AI Legal and Policy Applications NAACL 2025 MultiConIR: Towards Multi-Condition Information Retrieval EMNLP 2025 Near-optimal Active Regression of Single-Index Models ICLR 2025 On the query complexity of sampling from non-log-concave distributions (extended abstract) COLT 2025 Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs COLT 2025 Oracle efficient truncated statistics ICLR 2025 Quantum Best Arm Identification with Quantum Oracles AAAI 2025 Searching for and Avoiding Hidden Sets Using Queries with Local Feedback AAAI 2025 SkewRoute: Training-Free LLM Routing for Knowledge Graph Retrieval-Augmented Generation via Score Skewness of Retrieved Context EMNLP 2025