polynomial time

Trembling-Hand Perfection and Correlation in Sequential Games AAAI 2021 Vector-output ReLU Neural Network Problems are Copositive Programs: Convex Analysis of Two Layer Networks and Polynomial-time Algorithms ICLR 2021 Wasserstein barycenters can be computed in polynomial time in fixed dimension JMLR 2021 Better Algorithms for Estimating Non-Parametric Models in Crowd-Sourcing and Rank Aggregation COLT 2020 Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay NeurIPS 2020 ID3 Learns Juntas for Smoothed Product Distributions COLT 2020 Can Adversarially Robust Learning LeverageComputational Hardness? ALT 2019 Evolving Solutions to Community-Structured Satisfiability Formulas AAAI 2019 Exact inference in structured prediction NeurIPS 2019 Inverting Deep Generative models, One layer at a time NeurIPS 2019 Learning Two Layer Rectified Neural Networks in Polynomial Time COLT 2019 Learning linear structural equation models in polynomial time and sample complexity AISTATS 2018 Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time ICML 2018 Lower Bounds for Higher-Order Convex Optimization COLT 2018 Novel Structural Parameters for Acyclic Planning Using Tree Embeddings IJCAI 2018 Pseudo-Boolean Constraints from a Knowledge Representation Perspective IJCAI 2018 Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract) IJCAI 2018 An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization IJCAI 2017 Computing an Approximately Optimal Agreeable Set of Items IJCAI 2017 Equilibria in Ordinal Games: A Framework based on Possibility Theory. IJCAI 2017 Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputs ICML 2017 Recognizing Top-Monotonic Preference Profiles in Polynomial Time IJCAI 2017 Reliably Learning the ReLU in Polynomial Time COLT 2017 L1-regularized Neural Networks are Improperly Learnable in Polynomial Time ICML 2016 Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number NeurIPS 2015