Skip to content
conftrace_

Papers (including subtopics)

Competitive Gradient Descent NeurIPS 2019 Compiling Bayesian Network Classifiers into Decision Graphs AAAI 2019 Complement Objective Training ICLR 2019 Complexities in Projection-Free Stochastic Non-convex Minimization AISTATS 2019 Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract) IJCAI 2019 Complexity of Highly Parallel Non-Smooth Convex Optimization NeurIPS 2019 Complexity of Linear Regions in Deep Networks ICML 2019 Complex Moment-Based Supervised Eigenmap for Dimensionality Reduction AAAI 2019 Complex Unitary Recurrent Neural Networks Using Scaled Cayley Transform AAAI 2019 Compositional Questions Do Not Necessitate Multi-hop Reasoning ACL 2019 Compound Probabilistic Context-Free Grammars for Grammar Induction ACL 2019 Compressed Factorization: Fast and Accurate Low-Rank Factorization of Compressively-Sensed Data ICML 2019 Compressing Convolutional Neural Networks via Factorized Convolutional Filters CVPR 2019 Compressing Gradient Optimizers via Count-Sketches ICML 2019 Compression with Flows via Local Bits-Back Coding NeurIPS 2019 Computational Limitations in Robust Classification and Win-Win Results COLT 2019 Computationally and Statistically Efficient Truncated Regression COLT 2019 Computational Separations between Sampling and Optimization NeurIPS 2019 Computation Efficient Coded Linear Transform AISTATS 2019 Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent IJCAI 2019 Computing Full Conformal Prediction Set with Approximate Homotopy NeurIPS 2019 Computing Linear Restrictions of Neural Networks NeurIPS 2019 Concentration Inequalities for Conditional Value at Risk ICML 2019 Concentration of risk measures: A Wasserstein distance approach NeurIPS 2019 Concurrency Debugging with MaxSMT AAAI 2019