Skip to content
conftrace_

Papers (including subtopics)

SAT-Based Explicit LTLf Satisfiability Checking AAAI 2019 Scalable and Congestion-Aware Routing for Autonomous Mobility-On-Demand Via Frank-Wolfe Optimization RSS 2019 Scalable Approximations for Generalized Linear Problems JMLR 2019 Scalable Fair Clustering ICML 2019 Scalable Global Optimization via Local Bayesian Optimization NeurIPS 2019 Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching NeurIPS 2019 Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds JMLR 2019 Scalable Learning in Reproducing Kernel Krein Spaces ICML 2019 Scalable Metropolis-Hastings for Exact Bayesian Inference with Large Datasets ICML 2019 Scalable Robust Kidney Exchange AAAI 2019 Scalable Thompson Sampling via Optimal Transport AISTATS 2019 Scale-free adaptive planning for deterministic dynamics & discounted rewards ICML 2019 Scaling-Up Split-Merge MCMC with Locality Sensitive Sampling (LSS) AAAI 2019 Scheduling Jobs with Stochastic Processing Time on Parallel Identical Machines IJCAI 2019 Schelling Games on Graphs IJCAI 2019 Screening Sinkhorn Algorithm for Regularized Optimal Transport NeurIPS 2019 SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration Without Correspondences CVPR 2019 Secretary Ranking with Minimal Inversions NeurIPS 2019 Selecting Compliant Agents for Opt-in Micro-Tolling AAAI 2019 Selecting Optimal Decisions via Distributionally Robust Nearest-Neighbor Regression NeurIPS 2019 Self-Paced Multi-Label Learning with Diversity ACML 2019 Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functions ICLR 2019 Semi-Autonomous Robot Teleoperation with Obstacle Avoidance Via Model Predictive Control RSS 2019 Semi-Parametric Efficient Policy Learning with Continuous Actions NeurIPS 2019 Sequential Experimental Design for Transductive Linear Bandits NeurIPS 2019