Skip to content
conftrace_

Papers (including subtopics)

Black-Box Reductions for Parameter-free Online Learning in Banach Spaces COLT 2018 Blind Deconvolutional Phase Retrieval via Convex Programming NeurIPS 2018 Boolean Decision Rules via Column Generation NeurIPS 2018 Boosting Combinatorial Problem Modeling with Machine Learning IJCAI 2018 Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems ACML 2018 Boosting MCSes Enumeration IJCAI 2018 Bounded-Loss Private Prediction Markets NeurIPS 2018 Breaking the Span Assumption Yields Fast Finite-Sum Minimization NeurIPS 2018 Bringing Multi-agent Path Finding Closer to Reality IJCAI 2018 Bucket Renormalization for Approximate Inference ICML 2018 Budget-feasible Procurement Mechanisms in Two-sided Markets IJCAI 2018 Byzantine Stochastic Gradient Descent NeurIPS 2018 Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice JMLR 2018 Causal Bandits with Propagating Inference ICML 2018 Celer: a Fast Solver for the Lasso with Dual Extrapolation ICML 2018 Certified Computation from Unreliable Datasets COLT 2018 Ceteris paribus majority for social ranking IJCAI 2018 Characterizing Implicit Bias in Terms of Optimization Geometry ICML 2018 Classification Transfer for Qualitative Reasoning Problems IJCAI 2018 Clustering Algorithms for the Centralized and Local Models ALT 2018 Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling JMLR 2018 CoCoA: A General Framework for Communication-Efficient Distributed Optimization JMLR 2018 Combinatorial Auctions via Machine Learning-based Preference Elicitation IJCAI 2018 Combinatorial Cost Sharing IJCAI 2018 Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search NeurIPS 2018