Mathematics & Optimization

Parallels Between Phase Transitions and Circuit Complexity? COLT 2020 Parameterized Algorithms for Finding a Collective Set of Items AAAI 2020 Parameterized Complexity of Envy-Free Resource Allocation in Social Networks AAAI 2020 Parameterized Rate-Distortion Stochastic Encoder ICML 2020 Parameter Optimization for Learning-based Control of Control-Affine Systems L4DC 2020 Partial Optimal Tranport with applications on Positive-Unlabeled Learning NeurIPS 2020 Partial Trace Regression and Low-Rank Kraus Decomposition ICML 2020 Participatory Budgeting with Project Interactions IJCAI 2020 Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms JMLR 2020 Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek AAAI 2020 Pay Your Trip for Traffic Congestion: Dynamic Pricing in Traffic-Aware Road Networks AAAI 2020 pbSGD: Powered Stochastic Gradient Descent Methods for Accelerated Non-Convex Optimization IJCAI 2020 PeerNomination: Relaxing Exactness for Increased Accuracy in Peer Selection IJCAI 2020 Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets NeurIPS 2020 PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures AISTATS 2020 Personalized Federated Learning with Moreau Envelopes NeurIPS 2020 Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud AAAI 2020 Phase retrieval in high dimensions: Statistical and computational phase transitions NeurIPS 2020 Photometric Stereo via Discrete Hypothesis-and-Test Search CVPR 2020 PIDS: An Intelligent Electric Power Management Platform AAAI 2020 Piecewise Linear Regression via a Difference of Convex Functions ICML 2020 Plankton: Scalable network configuration verification through model checking NSDI 2020 Planning Algorithms for Zero-Sum Games with Exponential Action Spaces: A Unifying Perspective IJCAI 2020 Planning with General Objective Functions: Going Beyond Total Rewards NeurIPS 2020 Please Mind the Root: Decoding Arborescences for Dependency Parsing EMNLP 2020