Skip to content
conftrace_

Papers (including subtopics)

LP-SparseMAP: Differentiable Relaxed Optimization for Sparse Structured Prediction ICML 2020 LTLƒ Synthesis with Fairness and Stability Assumptions AAAI 2020 MAGSAC++, a Fast, Reliable and Accurate Robust Estimator CVPR 2020 Making Non-Stochastic Control (Almost) as Easy as Stochastic NeurIPS 2020 Manifold Identification for Ultimately Communication-Efficient Distributed Optimization ICML 2020 Manipulating Districts to Win Elections: Fine-Grained Complexity AAAI 2020 Manipulation Trajectory Optimization with Online Grasp Synthesis and Selection RSS 2020 MAP Inference for Customized Determinantal Point Processes via Maximum Inner Product Search AISTATS 2020 Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks IJCAI 2020 Maximizing Welfare with Incentive-Aware Evaluation Mechanisms IJCAI 2020 Maximum Margin Multi-Dimensional Classification AAAI 2020 Maximum Nash Welfare and Other Stories About EFX IJCAI 2020 Measuring Mutual Information Between All Pairs of Variables in Subquadratic Complexity AISTATS 2020 Mechanism Design for School Choice with Soft Diversity Constraints IJCAI 2020 Median Matrix Completion: from Embarrassment to Optimality ICML 2020 Memory-Efficient Learning of Stable Linear Dynamical Systems for Prediction and Control NeurIPS 2020 Memoryless Sequences for General Losses JMLR 2020 Message Passing Least Squares Framework and its Application to Rotation Synchronization ICML 2020 Metric Learning in Optimal Transport for Domain Adaptation IJCAI 2020 Microsecond Consensus for Microsecond Applications OSDI 2020 MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment CVPR 2020 Minibatch Stochastic Approximate Proximal Point Methods NeurIPS 2020 Minimax Bounds for Structured Prediction Based on Factor Graphs AISTATS 2020 Minimax Pareto Fairness: A Multi Objective Perspective ICML 2020 Minimax Rank-$1$ Matrix Factorization AISTATS 2020