Mathematics & Optimization

Fairness Concepts for Indivisible Items with Externalities AAAI 2023 Fairness in Streaming Submodular Maximization over a Matroid Constraint ICML 2023 Fair, Polylog-Approximate Low-Cost Hierarchical Clustering NeurIPS 2023 Fair Short Paths in Vertex-Colored Graphs AAAI 2023 Faith-Shap: The Faithful Shapley Interaction Index JMLR 2023 False Discovery Proportion control for aggregated Knockoffs NeurIPS 2023 Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers AAAI 2023 Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization ICML 2023 Fast Algorithms for a New Relaxation of Optimal Transport COLT 2023 Fast Algorithms for Distributed k-Clustering with Outliers ICML 2023 Fast Algorithms for SAT with Bounded Occurrences of Variables IJCAI 2023 FastAMI – a Monte Carlo Approach to the Adjustment for Chance in Clustering Comparison Metrics AAAI 2023 Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates AAAI 2023 Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms NeurIPS 2023 Fast Approximation of Similarity Graphs with Kernel Density Estimation NeurIPS 2023 Fast as CHITA: Neural Network Pruning with Combinatorial Optimization ICML 2023 Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits NeurIPS 2023 Fast Bellman Updates for Wasserstein Distributionally Robust MDPs NeurIPS 2023 Fast Block Coordinate Descent for Non-Convex Group Regularizations AISTATS 2023 Fast Combinatorial Algorithms for Min Max Correlation Clustering ICML 2023 Fast Computation of Branching Process Transition Probabilities via ADMM AISTATS 2023 Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions NeurIPS 2023 Fast Converging Anytime Model Counting AAAI 2023 Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective ICML 2023 Faster approximate subgraph counts with privacy NeurIPS 2023