greedy algorithm

City Sampling for Citizens’ Assemblies AAAI 2026 Greedily Maximizing Ex-Ante Fairness AAAI 2026 IDCR: Information-Directed Conformal Retrieval UAI 2026 Information Theoretic Optimal Surveillance for Epidemic Prevalence in Networks AAAI 2026 Spectral Valleys and Sharp Failures in Greedy Determinant Maximization COLT 2026 Which Directions Matter? Sparse Design for Affine Robust Optimization UAI 2026 Add-One-In: Incremental Sample Selection for Large Language Models via a Choice-Based Greedy Paradigm EMNLP 2025 A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time UAI 2025 Data Quality Enhancement on the Basis of Diversity with Large Language Models for Text Classification: Uncovered, Difficult, and Noisy COLING 2025 DPFL: Decentralized Personalized Federated Learning AISTATS 2025 High-Dimensional L2-Boosting: Rate of Convergence JMLR 2025 Hyperparametric Robust and Dynamic Influence Maximization AAAI 2025 It’s My Data Too: Private ML for Datasets with Multi-User Training Examples ICML 2025 Lower Bounds for Greedy Teaching Set Constructions COLT 2025 Morpheme Induction for Emergent Language EMNLP 2025 MutualNeRF: Improve the Performance of NeRF under Limited Samples with Mutual Information Theory UAI 2025 TAGCOS: Task-agnostic Gradient Clustered Coreset Selection for Instruction Tuning Data NAACL 2025 Using Submodular Optimization to Approximate Minimum-Size Abductive Path Explanations for Tree-Based Models UAI 2025 Adaptive Time-Stepping Schedules for Diffusion Models UAI 2024 Automatic Engineering of Long Prompts ACL 2024 Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization NeurIPS 2024 Efficient Modality Selection in Multimodal Learning JMLR 2024 Evaluation of Project Performance in Participatory Budgeting IJCAI 2024 Fast 1-Wasserstein distance approximations using greedy strategies AISTATS 2024 Fast Rates in Pool-Based Batch Active Learning JMLR 2024