Skip to content
conftrace_

Papers (including subtopics)

Lower Bounds for Higher-Order Convex Optimization COLT 2018 Low-rank Interaction with Sparse Additive Effects Model for Large Data Frames NeurIPS 2018 LSTM Based Cross-corpus and Cross-task Acoustic Emotion Recognition Interspeech 2018 LSTMs Can Learn Syntax-Sensitive Dependencies Well, But Modeling Structure Makes Them Better ACL 2018 LSTMs Exploit Linguistic Attributes of Data ACL 2018 Lyapunov Functions for First-Order Methods: Tight Automated Convergence Guarantees ICML 2018 Machine Learning and Constraint Programming for Relational-To-Ontology Schema Mapping IJCAI 2018 Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits ICML 2018 Making Classifier Chains Resilient to Class Imbalance ACML 2018 Making Tree Ensembles Interpretable: A Bayesian Model Selection Approach AISTATS 2018 Mallows Models for Top-k Lists NeurIPS 2018 Manifold Structured Prediction NeurIPS 2018 Many Paths to Equilibrium: GANs Do Not Need to Decrease a Divergence At Every Step ICLR 2018 Marginal Singularity, and the Benefits of Labels in Covariate-Shift COLT 2018 Marian: Fast Neural Machine Translation in C++ ACL 2018 Markov Random Field MAP as Set Partitioning PGM 2018 Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under ℓ_p Distances ICML 2018 Matrix capsules with EM routing ICLR 2018 Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order ICML 2018 Maximizing acquisition functions for Bayesian optimization NeurIPS 2018 Maximizing Induced Cardinality Under a Determinantal Point Process NeurIPS 2018 Maximum a Posteriori Policy Optimisation ICLR 2018 Maximum-Entropy Fine Grained Classification NeurIPS 2018 Maximum Likelihood Estimation for Mixtures of Spherical Gaussians is NP-hard JMLR 2018 Maximum Principle Based Algorithms for Deep Learning JMLR 2018