Skip to content
conftrace_

Papers (including subtopics)

Tight Bounds for the Expected Risk of Linear Classifiers and PAC-Bayes Finite-Sample Guarantees AISTATS 2014 Tight Continuous Relaxation of the Balanced k-Cut Problem NeurIPS 2014 Tight convex relaxations for sparse matrix factorization NeurIPS 2014 Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time NeurIPS 2014 Tilted Variational Bayes AISTATS 2014 Time--Data Tradeoffs by Aggressive Smoothing NeurIPS 2014 Time-Regularized Interrupting Options (TRIO) ICML 2014 To go deep or wide in learning? AISTATS 2014 Top Rank Optimization in Linear Time NeurIPS 2014 Total-Variation Minimization on Unstructured Volumetric Mesh: Biophysical Applications on Reconstruction of 3D Ischemic Myocardium CVPR 2014 Towards an optimal stochastic alternating direction method of multipliers ICML 2014 Towards Maximum Likelihood: Learning Undirected Graphical Models using Persistent Sequential Monte Carlo ACML 2014 Towards Minimax Online Learning with Unknown Time Horizon ICML 2014 Towards scaling up Markov chain Monte Carlo: an adaptive subsampling approach ICML 2014 Towards Ultrahigh Dimensional Feature Selection for Big Data JMLR 2014 Tracking Adversarial Targets ICML 2014 Training Highly Multiclass Classifiers JMLR 2014 Transitive Distance Clustering with K-Means Duality CVPR 2014 Tree-structured Gaussian Process Approximations NeurIPS 2014 Two-Class Weather Classification CVPR 2014 Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets NeurIPS 2014 Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations COLT 2014 Understanding Protein Dynamics with L1-Regularized Reversible Hidden Markov Models ICML 2014 Understanding the Limiting Factors of Topic Modeling via Posterior Contraction Analysis ICML 2014 Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014