conftrace_

algorithm analysis

22 papers

Explore in graph

Co-occurring keywords

graphical model (864) fixed point (30) computational complexity (399) probabilistic inference (312) k-means clustering (235) reinforcement learning (4352) max-product algorithm (6) optimization bounds (1) hyperparameter tuning (215) time complexity (18)

Papers

Learning DFAs from Positive Examples Only via Word Counting AAAI 2026
CodeComplex: Dataset for Worst-Case Time Complexity Prediction EMNLP 2025
Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search AAAI 2025
Revisiting Differentially Private ReLU Regression NIPS 2024
Random Cuts are Optimal for Explainable k-Medians NIPS 2023
An Equivalence Analysis of Binary Quantification Methods AAAI 2023
Three Iterations of (d − 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points NIPS 2023
Time-Constrained Participatory Budgeting Under Uncertain Project Costs IJCAI 2022
The Query Complexity of Cake Cutting NIPS 2022
How to scale hyperparameters for quickshift image segmentation AISTATS 2022
The Successful Ingredients of Policy Gradient Algorithms IJCAI 2021
Simple and sharp analysis of k-means|| ICML 2020
The Computational Complexity of Angry Birds (Extended Abstract) IJCAI 2020
A Tighter Analysis of Randomised Policy Iteration UAI 2019
The Provable Virtue of Laziness in Motion Planning IJCAI 2019
Earliest-Completion Scheduling of Contract Algorithms with End Guarantees IJCAI 2019
Clustering Semi-Random Mixtures of Gaussians ICML 2018
The Limits of Post-Selection Generalization NIPS 2018
Uniqueness of Belief Propagation on Signed Graphs NIPS 2011
Discussion of “Contextual Bandit Algorithms with Supervised Learning Guarantees” AISTATS 2011
Worst-case bounds on the quality of max-product fixed-points NIPS 2010
Handling Advertisements of Unknown Quality in Search Advertising NIPS 2006