Mathematics & Optimization

Fitting trees to ℓ_1-hyperbolic distances NeurIPS 2023 Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks Using Graph Contraction NSDI 2023 Flaws of Termination and Optimality in ADOPT-based Algorithms IJCAI 2023 FLIP: A Utility Preserving Privacy Mechanism for Time Series JMLR 2023 Follow the leader(board) with confidence: Estimating p-values from a single test set with item and response variance ACL 2023 Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems ALT 2023 Formalizing Preferences Over Runtime Distributions ICML 2023 Formally Verified SAT-Based AI Planning AAAI 2023 Formally Verified Solution Methods for Markov Decision Processes AAAI 2023 Framework and Benchmarks for Combinatorial and Mixed-variable Bayesian Optimization NeurIPS 2023 Free Lunch for Efficient Textual Commonsense Integration in Language Models ACL 2023 Frequency Domain-Based Dataset Distillation NeurIPS 2023 Frequency Patterns of Individual Speaker Characteristics at Higher and Lower Spectral Ranges Interspeech 2023 From Pseudorandomness to Multi-Group Fairness and Back COLT 2023 From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms JMLR 2023 From Width-Based Model Checking to Width-Based Automated Theorem Proving AAAI 2023 Frustratingly Easy Truth Discovery AAAI 2023 Fully-Adaptive Composition in Differential Privacy ICML 2023 Fully Computer-Assisted Proofs in Extremal Combinatorics AAAI 2023 Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time NeurIPS 2023 Fully Dynamic Online Selection through Online Contention Resolution Schemes AAAI 2023 Fully Dynamic Submodular Maximization over Matroids ICML 2023 Fully Online Matching with Stochastic Arrivals and Departures AAAI 2023 Function Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games AAAI 2023 Fundamental limits and algorithms for sparse linear regression with sublinear sparsity JMLR 2023