Skip to content
conftrace_

approximation guarantee

92 papers

Papers

Algorithms for Context Engineering in LLM Inference: Optimization of Placement, Compression, and Scheduling AAAI 2026 Pareto-Optimal Probabilistic Explanations: Balancing Cognitive Constraints and User Preferences UAI 2026 Scalable Solutions to Zero-Sum Partially Observable Stochastic Games Through Belief Aggregation with Approximation Guarantees AAAI 2026 Which Directions Matter? Sparse Design for Affine Robust Optimization UAI 2026 A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage AISTATS 2025 Importance Sampling for Nonlinear Models ICML 2025 Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025 Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II IJCAI 2025 The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III) IJCAI 2025 Convex Relaxations for Manifold-Valued Markov Random Fields with Approximation Guarantees ECCV 2024 Dynamic Spectral Clustering with Provable Approximation Guarantee ICML 2024 Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints IJCAI 2024 Learning-Augmented Dynamic Submodular Maximization NeurIPS 2024 Measures of diversity and space-filling designs for categorical data ICML 2024 Mechanism design augmented with output advice NeurIPS 2024 Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models ICML 2024 Active Learning for Single Neuron Models with Lipschitz Non-Linearities AISTATS 2023 Composable Coresets for Determinant Maximization: Greedy is Almost Optimal NeurIPS 2023 Optimization of Inter-group criteria for clustering with minimum size constraints NeurIPS 2023 Path following algorithms for ℓ_2-regularized M-estimation with approximation guarantee NeurIPS 2023 Provably Auditing Ordinary Least Squares in Low Dimensions ICLR 2023 Submodular Order Functions and Assortment Optimization ICML 2023 Agnostic Learnability of Halfspaces via Logistic Loss ICML 2022 Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+Optimize NeurIPS 2022 Heterogeneous Facility Location with Limited Resources AAAI 2022