Skip to content
conftrace_

AISTATS 2005

84 papers

Latent Variable Models for Dimensionality Reduction

Zhihua Zhang, Michael I. Jordan

Coherence Functions for Multicategory Margin-based Classification Methods

Zhihua Zhang, Michael Jordan, Wu-jun Li, Dit-Yan Yeung

Active Sensing

Shipeng Yu, Balaji Krishnapuram, Rómer Rosales, R. Bharat Rao

Dual Temporal Difference Learning

Min Yang, Yuxi Li, Dale Schuurmans

Tree-Based Inference for Dirichlet Process Mixtures

Yang Xu, Katherine Heller, Zoubin Ghahramani

Speed and Sparsity of Regularized Boosting

Yongxin Xi, Zhen Xiang, Peter Ramadge, Robert Schapire

Markov Topic Models

Chong Wang, Bo Thiesson, Chris Meek, David Blei

Non-Negative Semi-Supervised Learning

Changhu Wang, Shuicheng Yan, Lei Zhang, Hongjiang Zhang

Variable Metric Stochastic Approximation Theory

Peter Sunehag, Jochen Trumpf, S.v.n. Vishwanathan, Nicol Schraudolph

The Block Diagonal Infinite Hidden Markov Model

Thomas Stepleton, Zoubin Ghahramani, Geoffrey Gordon, Tai-Sing Lee

Relative Novelty Detection

Alex Smola, Le Song, Choon Hui Teo

MCMC Methods for Bayesian Mixtures of Copulas

Ricardo Silva, Robert Gramacy

Locally Minimax Optimal Predictive Modeling with Bayesian Networks

Tomi Silander, Teemu Roos, Petri Myllymäki

Hash Kernels

Qinfeng Shi, James Petterson, Gideon Dror, John Langford, Alex Smola

Efficient graphlet kernels for large graph comparison

Nino Shervashidze, SVN Vishwanathan, Tobias Petri, Kurt Mehlhorn, Karsten Borgwardt

PAC-Bayes Analysis Of Maximum Entropy Classification

John Shawe-Taylor, David Hardoon

Novelty detection: Unlabeled data definitely help

Clayton Scott, Gilles Blanchard

Deep Boltzmann Machines

Ruslan Salakhutdinov, Geoffrey Hinton

Inverse Optimal Heuristic Control for Imitation Learning

Nathan Ratliff, Brian Ziebart, Kevin Peterson, J. Andrew Bagnell, Martial Hebert

Chromatic PAC-Bayes Bounds for Non-IID Data

Liva Ralaivola, Marie Szafranski, Guillaume Stempfel

Spanning Tree Approximations for Conditional Random Fields

Patrick Pletscher, Cheng Soon Ong, Joachim Buhmann

Exact and Approximate Sampling by Systematic Stochastic Search

Vikash Mansinghka, Daniel Roy, Eric Jonas, Joshua Tenenbaum

A kernel method for unsupervised structured network inference

Christoph Lippert, Oliver Stegle, Zoubin Ghahramani, Karsten Borgwardt

Learning Sparse Markov Network Structure via Ensemble-of-Trees Models

Yuanqing Lin, Shenghuo Zhu, Daniel Lee, Ben Taskar

Learning Exercise Policies for American Options

Yuxi Li, Csaba Szepesvári, Dale Schuurmans

Tighter and Convex Maximum Margin Clustering

Yu-feng Li, Ivor W. Tsang, Jame Kwok, Zhi-Hua Zhou

Latent Wishart Processes for Relational Kernel Learning

Wu-jun Li, Zhihua Zhang, Dit-Yan Yeung

Kernel Learning by Unconstrained Optimization

Fuxin Li, Yunshan Fu, Yu-Hong Dai, Cristian Sminchisescu, Jue Wang

Deep Learning using Robust Interdependent Codes

Hugo Larochelle, Dumitru Erhan, Pascal Vincent

Sampling Techniques for the Nystrom Method

Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar

Convex Perturbations for Scalable Semidefinite Programming

Brian Kulis, Suvrit Sra, Inderjit Dhillon

Data Biased Robust Counter Strategies

Michael Johanson, Michael Bowling

Particle Belief Propagation

Alexander Ihler, David Mcallester

Exploiting Probabilistic Independence for Permutations

Jonathan Huang, Carlos Guestrin, Xiaoye Jiang, Leonidas Guibas

Infinite Hierarchical Hidden Markov Models

Katherine Heller, Yee Whye Teh, Dilan Gorur

Network Completion and Survey Sampling

Steve Hanneke, Eric P. Xing

Active Learning as Non-Convex Optimization

Andrew Guillory, Erick Chastain, Jeff Bilmes

Visualization Databases for the Analysis of Large Complex Datasets

Saptarshi Guha, Paul Kidwell, Ryan P. Hafen, William S. Cleveland

Residual Splash for Optimally Parallelizing Belief Propagation

Joseph Gonzalez, Yucheng Low, Carlos Guestrin

Multi-Manifold Semi-Supervised Learning

Andrew Goldberg, Xiaojin Zhu, Aarti Singh, Zhiting Xu, Robert Nowak

The Difficulty of Training Deep Architectures and the Effect of Unsupervised Pre-Training

Dumitru Erhan, Pierre-antoine Manzagol, Yoshua Bengio, Samy Bengio, Pascal Vincent

Choosing a Variable to Clamp

Frederik Eaton, Zoubin Ghahramani

Variational Inference for the Indian Buffet Process

Finale Doshi, Kurt Miller, Jurgen Van Gael, Yee Whye Teh

Matching Pursuit Kernel Fisher Discriminant Analysis

Tom Diethe, Zakria Hussain, David Hardoon, John Shawe-Taylor

Learning Thin Junction Trees via Graph Cuts

Shahaf Dafna, Carlos Guestrin

Gaussian Margin Machines

Koby Crammer, Mehryar Mohri, Fernando Pereira

On Partitioning Rules for Bipartite Ranking

Stéphan Clémençon, Nicolas Vayatis

Handling Sparsity via the Horseshoe

Carlos M. Carvalho, Nicholas G. Polson, James G. Scott

Online Inference of Topics with Latent Dirichlet Allocation

Kevin Canini, Lei Shi, Thomas Griffiths

Structure Identification by Optimized Interventions

Alberto Giovanni Busetto, Joachim Buhmann

Estimating Tree-Structured Covariance Matrices via Mixed-Integer Programming

Hector Corrada Bravo, Stephen Wright, Kevin Eng, Sunduz Keles, Grace Wahba

Supervised Spectral Latent Variable Models

Liefeng Bo, Cristian Sminchisescu

Learning Low Density Separators

Shai Ben-David, Tyler Lu, Dávid Pál, Miroslava Sotakova

Latent Force Models

Mauricio Alvarez, David Luengo, Neil D. Lawrence

Clusterability: A Theoretical Study

Margareta Ackerman, Shai Ben-David