conftrace_

polynomial time algorithm

55 papers

Explore in graph

Co-occurring keywords

polynomial-time algorithm (39) polynomial time (67) approximation algorithm (630) combinatorial optimization (1039) fair division (158) neural network (6616) correlated equilibrium (44) extensive-form game (86) dynamic programming (274) convex optimization (1321)

Papers

Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations NIPS 2021
The Complexity Landscape of Resource-Constrained Scheduling IJCAI 2020
Conditional Linear Regression AISTATS 2020
Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks COLT 2020
Approximability of Constant-horizon Constrained POMDP IJCAI 2019
Efficient Algorithms for Optimal Perimeter Guarding RSS 2019
Reallocating Multiple Facilities on the Line IJCAI 2019
Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions IJCAI 2019
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families NIPS 2019
A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates RSS 2019
Learning Neural Networks with Two Nonlinear Layers in Polynomial Time COLT 2019
Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games IJCAI 2018
Spectral Filtering for General Linear Dynamical Systems NIPS 2018
Breaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time COLT 2018
Finding Minimal Separators in LWF Chain Graphs PGM 2018
Maximin Share Allocations on Cycles IJCAI 2018
Being Robust (in High Dimensions) Can Be Practical ICML 2017
Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity NIPS 2017
Recognizing Top-Monotonic Preference Profiles in Polynomial Time IJCAI 2017
On the Learnability of Fully-Connected Neural Networks AISTATS 2017
Optimal Sparse Linear Encoders and Sparse PCA NIPS 2016
Efficient Globally Optimal 2D-To-3D Deformable Shape Matching CVPR 2016
A Spatiotemporal Optimal Stopping Problem for Mission Monitoring with Stationary Viewpoints RSS 2015
Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time NIPS 2014
Provable Submodular Minimization using Wolfe's Algorithm NIPS 2014