Skip to content
conftrace_

Papers (including subtopics)

IPBoost – Non-Convex Boosting via Integer Programming ICML 2020 IPO: Interior-Point Policy Optimization under Constraints AAAI 2020 Is Big Data Performance Reproducible in Modern Cloud Networks? NSDI 2020 Is Local SGD Better than Minibatch SGD? ICML 2020 Iterative Channel Estimation for Discrete Denoising under Channel Uncertainty UAI 2020 Iterative Delegations in Liquid Democracy with Restricted Preferences AAAI 2020 Joint Graph-Based Depth Refinement and Normal Estimation CVPR 2020 Joint learning of constraint weights and gradient inputs in Gradient Symbolic Computation with constrained optimization ACL 2020 Joint Partial Optimal Transport for Open Set Domain Adaptation IJCAI 2020 Joint Texture and Geometry Optimization for RGB-D Reconstruction CVPR 2020 Justifying All Differences Using Pseudo-Boolean Reasoning AAAI 2020 Kernel Methods Through the Roof: Handling Billions of Points Efficiently NeurIPS 2020 Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimization AISTATS 2020 KeyGames: A Game Theoretic Approach to Automatic Keyphrase Extraction COLING 2020 Kidney Exchange with Inhomogeneous Edge Existence Uncertainty UAI 2020 Knowing The What But Not The Where in Bayesian Optimization ICML 2020 Language Generation via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach EMNLP 2020 Large-Scale Methods for Distributionally Robust Optimization NeurIPS 2020 Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems COLT 2020 Latent Bandits Revisited NeurIPS 2020 Layered Sampling for Robust Optimization Problems ICML 2020 Lazy-CFR: fast and near-optimal regret minimization for extensive games with imperfect information ICLR 2020 LazyIter: A Fast Algorithm for Counting Markov Equivalent DAGs and Designing Experiments ICML 2020 Leading Multi-Agent Teams to Multiple Goals While Maintaining Communication RSS 2020 Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning ACML 2020