Optimization

The Tradeoffs of Large Scale Learning NeurIPS 2007 Topmoumoute Online Natural Gradient Algorithm NeurIPS 2007 Ultrafast Monte Carlo for Statistical Summations NeurIPS 2007 Very Fast Online Learning of Highly Non Linear Problems JMLR 2007 What makes some POMDP problems easy to approximate? NeurIPS 2007 Accelerated Variational Dirichlet Process Mixtures NeurIPS 2006 A Complexity-Distortion Approach to Joint Pattern Alignment NeurIPS 2006 A Direct Method for Building Sparse Kernel Learning Algorithms JMLR 2006 A Local Learning Approach for Clustering NeurIPS 2006 An Efficient Implementation of an Active Set Method for SVMs JMLR 2006 An Efficient Method for Gradient-Based Adaptation of Hyperparameters in SVM Models NeurIPS 2006 An EM Algorithm for Localizing Multiple Sound Sources in Reverberant Environments NeurIPS 2006 Approximate inference using planar graph decomposition NeurIPS 2006 Automated Hierarchy Discovery for Planning in Partially Observable Environments NeurIPS 2006 Balanced Graph Matching NeurIPS 2006 Bayesian Model Scoring in Markov Random Fields NeurIPS 2006 Bayesian Network Learning with Parameter Constraints JMLR 2006 Conditional Random Sampling: A Sketch-based Sampling Technique for Sparse Data NeurIPS 2006 Considering Cost Asymmetry in Learning Classifiers JMLR 2006 Convex Repeated Games and Fenchel Duality NeurIPS 2006 Cross-Validation Optimization for Large Scale Hierarchical Classification Kernel Methods NeurIPS 2006 Efficient Learning of Label Ranking by Soft Projections onto Polyhedra JMLR 2006 Efficient sparse coding algorithms NeurIPS 2006 Efficient Structure Learning of Markov Networks using L_1-Regularization NeurIPS 2006 Ensemble Pruning Via Semi-definite Programming JMLR 2006