index
int64
0
20.3k
text
stringlengths
0
1.3M
year
stringdate
1987-01-01 00:00:00
2024-01-01 00:00:00
No
stringlengths
1
4
2,400
No Unbiased Estimator of the Variance of K-Fold Cross-Validation Yoshua Bengio and Yves Grandvalet Dept. IRO, Universit´e de Montr´eal C.P. 6128, Montreal, Qc, H3C 3J7, Canada {bengioy,grandvay}@iro.umontreal.ca Abstract Most machine learning researchers perform quantitative experiments to estimate gene...
2003
182
2,401
GPPS: A Gaussian Process Positioning System for Cellular Networks Anton Schwaighofer∗, Marian Grigoras¸, Volker Tresp, Clemens Hoffmann Siemens Corporate Technology, Information and Communications 81730 Munich, Germany http://www.igi.tugraz.at/aschwaig Abstract In this article, we present a novel approach...
2003
183
2,402
Reconstructing MEG Sources with Unknown Correlations Maneesh Sahani W. M. Keck Foundation Center for Integrative Neuroscience, UC, San Francisco, CA 94143-0732 maneesh@phy.ucsf.edu Srikantan S. Nagarajan Biomagnetic Imaging Laboratory, Department of Radiology, UC, San Francisco, CA 94143-0628 sri@...
2003
184
2,403
Increase information transfer rates in BCI by CSP extension to multi-class Guido Dornhege1, Benjamin Blankertz1, Gabriel Curio2, Klaus-Robert Müller1,3 1Fraunhofer FIRST.IDA, Kekuléstr. 7, 12489 Berlin, Germany 2Neurophysics Group, Dept. of Neurology, Klinikum Benjamin Franklin, Freie Universität Berlin, Hind...
2003
185
2,404
Dopamine modulation in a basal ganglio-cortical network implements saliency-based gating of working memory Aaron J. Gruber1,2, Peter Dayan3, Boris S. Gutkin3, and Sara A. Solla2,4 Biomedical Engineering1, Physiology2, and Physics and Astronomy4, Northwestern University, Chicago, IL, USA. Gatsby Computationa...
2003
186
2,405
Approximate Planning in POMDPs with Macro-Actions Georgios Theocharous MIT AI Lab 200 Technology Square Cambridge, MA 02139 theochar@ai.mit.edu Leslie Pack Kaelbling MIT AI Lab 200 Technology Square Cambridge, MA 02139 lpk@ai.mit.edu Abstract Recent research has demonstrated that useful POMDP ...
2003
187
2,406
ARA*: Anytime A* with Provable Bounds on Sub-Optimality Maxim Likhachev, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 {maxim+, ggordon, thrun}@cs.cmu.edu Abstract In real world planning problems, time for deliberation is often limited. Any...
2003
188
2,407
Salient Boundary Detection using Ratio Contour Song Wang, Toshiro Kubota Dept. Computer Science & Engineering University of South Carolina Columbia, SC 29208 {songwang|kubota}@cse.sc.edu Jeffrey Mark Siskind School Electrical & Comput. Engr. Purdue University West Lafayette, IN 47906 qobi@purdue.edu...
2003
189
2,408
A Biologically Plausible Algorithm for Reinforcement-shaped Representational Learning Maneesh Sahani W.M. Keck Foundation Center for Integrative Neuroscience University of California, San Francisco, CA 94143-0732 maneesh@phy.ucsf.edu Abstract Significant plasticity in sensory cortical representations can...
2003
19
2,409
Semidefinite Programming by Perceptron Learning Thore Graepel Ralf Herbrich Microsoft Research Ltd., Cambridge, UK {thoreg,rherb}@microsoft.com Andriy Kharechko John Shawe-Taylor Royal Holloway, University of London, UK {ak03r,jst}@ecs.soton.ac.uk Abstract We present a modified version of the percep...
2003
190
2,410
An iterative improvement procedure for hierarchical clustering David Kauchak Department of Computer Science University of California, San Diego dkauchak@cs.ucsd.edu Sanjoy Dasgupta Department of Computer Science University of California, San Diego dasgupta@cs.ucsd.edu Abstract We describe a proced...
2003
191
2,411
Kernels for Structured Natural Language Data Jun Suzuki, Yutaka Sasaki, and Eisaku Maeda NTT Communication Science Laboratories, NTT Corp. 2-4 Hikaridai, Seika-cho, Soraku-gun, Kyoto, 619-0237 Japan {jun, sasaki, maeda}@cslab.kecl.ntt.co.jp Abstract This paper devises a novel kernel function for structured ...
2003
192
2,412
Near-Minimax Optimal Classification with Dyadic Classification Trees Clayton Scott Electrical and Computer Engineering Rice University Houston, TX 77005 cscott@rice.edu Robert Nowak Electrical and Computer Engineering University of Wisconsin Madison, WI 53706 nowak@engr.wisc.edu Abstract This pa...
2003
193
2,413
Bounded invariance and the formation of place fields Reto Wyss and Paul F.M.J. Verschure Institute of Neuroinformatics University/ETH Z¨urich Z¨urich, Switzerland rwyss,pfmjv@ini.phys.ethz.ch Abstract One current explanation of the view independent representation of space by the place-cells of the hipp...
2003
194
2,414
Learning curves for stochastic gradient descent in linear feedforward networks Justin Werfel Dept. of EECS MIT Cambridge, MA 02139 jkwerfel@mit.edu Xiaohui Xie Dept. of Molecular Biology Princeton University Princeton, NJ 08544 xhx@princeton.edu H. Sebastian Seung HHMI Dept. of Brain & Cog. ...
2003
195
2,415
Learning Bounds for a Generalized Family of Bayesian Posterior Distributions Tong Zhang IBM T.J. Watson Research Center Yorktown Heights, NY 10598 tzhang@watson.ibm.com Abstract In this paper we obtain convergence bounds for the concentration of Bayesian posterior distributions (around the true distribu...
2003
196
2,416
A Functional Architecture for Motion Pattern Processing in MSTd Scott A. Beardsley Lucia M. Vaina Dept. of Biomedical Engineering Dept. of Biomedical Engineering Boston University Boston University Boston, MA 02215 Boston, MA 02215 sbeardsl@bu.edu vaina@bu.edu ...
2003
197
2,417
Online Learning of Non-stationary Sequences Claire Monteleoni and Tommi Jaakkola MIT Computer Science and Artificial Intelligence Laboratory 200 Technology Square Cambridge, MA 02139 {cmontel,tommi}@ai.mit.edu Abstract We consider an online learning scenario in which the learner can make predictions on t...
2003
198
2,418
Linear Response for Approximate Inference Max Welling Department of Computer Science University of Toronto Toronto M5S 3G4 Canada welling@cs.utoronto.ca Yee Whye Teh Computer Science Division University of California at Berkeley Berkeley CA94720 USA ywteh@eecs.berkeley.edu Abstract Belief propag...
2003
2
2,419
Online Classification on a Budget Koby Crammer Computer Sci. & Eng. Hebrew University Jerusalem 91904, Israel kobics@cs.huji.ac.il Jaz Kandola Royal Holloway, University of London Egham, UK jaz@cs.rhul.ac.uk Yoram Singer Computer Sci. & Eng. Hebrew University Jerusalem 91904, Israel singer@...
2003
20
2,420
Pairwise Clustering and Graphical Models Noam Shental Computer Science & Eng. Center for Neural Computation Hebrew University of Jerusalem Jerusalem, Israel 91904 fenoam@cs.huji.ac.il Assaf Zomet Computer Science & Eng. Hebrew University of Jerusalem Jerusalem, Israel 91904 zomet@cs.huji.ac.il T...
2003
21
2,421
Link Prediction in Relational Data Ben Taskar Ming-Fai Wong Pieter Abbeel Daphne Koller {btaskar, mingfai.wong, abbeel, koller}@cs.stanford.edu Stanford University Abstract Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This pape...
2003
22
2,422
Human and Ideal Observers for Detecting Image Curves Alan Yuille Department of Statistics & Psychology University of California Los Angeles Los Angeles CA yuille@stat.ucla.edu Fang Fang Psychology, University of Minnesota Minneapolis MN 55455 fang0057@tc.umn.edu Paul Schrater Psychology, Univers...
2003
23
2,423
Linear Program Approximations for Factored Continuous-State Markov Decision Processes Milos Hauskrecht and Branislav Kveton Department of Computer Science and Intelligent Systems Program University of Pittsburgh milos,bkveton  @cs.pitt.edu Abstract Approximate linear programming (ALP) has emerged rec...
2003
24
2,424
Perception of the structure of the physical world using unknown multimodal sensors and effectors D. Philipona Sony CSL, 6 rue Amyot 75005 Paris, France david.philipona@m4x.org J.K. O’Regan Laboratoire de Psychologie Exp´erimentale, CNRS Universit´e Ren´e Descartes, 71, avenue Edouard Vaillant 92774 Bo...
2003
25
2,425
Log-Linear Models for Label Ranking Ofer Dekel Computer Science & Eng. Hebrew University oferd@cs.huji.ac.il Christopher D. Manning Computer Science Dept. Stanford University manning@cs.stanford.edu Yoram Singer Computer Science & Eng. Hebrew University singer@cs.huji.ac.il Abstract Label ra...
2003
26
2,426
Learning the k in k-means Greg Hamerly, Charles Elkan {ghamerly,elkan}@cs.ucsd.edu Department of Computer Science and Engineering University of California, San Diego La Jolla, California 92093-0114 Abstract When clustering a dataset, the right number k of clusters to use is often not obvious, and choo...
2003
27
2,427
Learning a Rare Event Detection Cascade by Direct Feature Selection Jianxin Wu James M. Rehg Matthew D. Mullin College of Computing and GVU Center, Georgia Institute of Technology {wujx, rehg, mdmullin}@cc.gatech.edu Abstract Face detection is a canonical example of a rare event detection problem, in wh...
2003
28
2,428
Non-linear CCA and PCA by Alignment of Local Models Jakob J. Verbeek†, Sam T. Roweis‡, and Nikos Vlassis† † Informatics Institute, University of Amsterdam ‡ Department of Computer Science,University of Toronto Abstract We propose a non-linear Canonical Correlation Analysis (CCA) method which works by coor...
2003
29
2,429
Wormholes Improve Contrastive Divergence Geoffrey Hinton, Max Welling and Andriy Mnih Department of Computer Science, University of Toronto 10 King’s College Road, Toronto, M5S 3G5 Canada {hinton,welling,amnih}@cs.toronto.edu Abstract In models that define probabilities via energies, maximum likelihood lea...
2003
3
2,430
Unsupervised context sensitive language acquisition from a large corpus Zach Solan, David Horn, Eytan Ruppin Sackler Faculty of Exact Sciences Tel Aviv University Tel Aviv, Israel 69978 {rsolan,horn,ruppin}@post.tau.ac.il Shimon Edelman Department of Psychology Cornell University Ithaca, NY 14853, U...
2003
30
2,431
Modeling User Rating Profiles For Collaborative Filtering Benjamin Marlin Department of Computer Science University of Toronto Toronto, ON, M5S 3H5, CANADA marlin@cs.toronto.edu Abstract In this paper we present a generative latent variable model for rating-based collaborative filtering called the User ...
2003
31
2,432
Learning a world model and planning with a self-organizing, dynamic neural system Marc Toussaint Institut f¨ur Neuroinformatik Ruhr-Universit¨at Bochum, ND 04 44780 Bochum—Germany mt@neuroinformatik.rub.de Abstract We present a connectionist architecture that can learn a model of the relations between...
2003
32
2,433
Bias-Corrected Bootstrap and Model Uncertainty Harald Steck∗ MIT CSAIL 200 Technology Square Cambridge, MA 02139 harald@ai.mit.edu Tommi S. Jaakkola MIT CSAIL 200 Technology Square Cambridge, MA 02139 tommi@ai.mit.edu Abstract The bootstrap has become a popular method for exploring model (st...
2003
33
2,434
÷ Nonlinear processing in LGN neurons Vincent Bonin* , Valerio Mante and Matteo Carandini Smith-Kettlewell Eye Research Institute 2318 Fillmore Street San Francisco, CA 94115, USA Institute of Neuroinformatics University of Zurich and ETH Zurich Winterthurerstrasse 190 CH-8...
2003
34
2,435
Ranking on Data Manifolds Dengyong Zhou, Jason Weston, Arthur Gretton, Olivier Bousquet, and Bernhard Sch¨olkopf Max Planck Institute for Biological Cybernetics, 72076 Tuebingen, Germany {firstname.secondname }@tuebingen.mpg.de Abstract The Google search engine has enjoyed huge success with its web page ra...
2003
35
2,436
Approximate Analytical Bootstrap Averages for Support Vector Classifiers D¨orthe Malzahn1,2 Manfred Opper3 1 Informatics and Mathematical Modelling, Technical University of Denmark, R.-Petersens-Plads, Building 321, Lyngby DK-2800, Denmark 2 Institute of Mathematical Stochastics, University of Karlsruhe, E...
2003
36
2,437
An Infinity-sample Theory for Multi-category Large Margin Classification Tong Zhang IBM T.J. Watson Research Center Yorktown Heights, NY 10598 tzhang@watson.ibm.com Abstract The purpose of this paper is to investigate infinity-sample properties of risk minimization based multi-category classification method...
2003
37
2,438
Abstract The relative depth of objects causes small shifts in the left and right retinal positions of these objects, called binocular disparity. Here, we describe a neuromorphic implementation of a disparity selective complex cell using the binocular energy model, which has been proposed to model the response of ...
2003
38
2,439
Robustness in Markov Decision Problems with Uncertain Transition Matrices∗ Arnab Nilim Department of EECS † University of California Berkeley, CA 94720 nilim@eecs.berkeley.edu Laurent El Ghaoui Department of EECS University of California Berkeley, CA 94720 elghaoui@eecs.berkeley.edu Abstract O...
2003
39
2,440
Probability Estimates for Multi-class Classification by Pairwise Coupling Ting-Fan Wu Chih-Jen Lin Department of Computer Science National Taiwan University Taipei 106, Taiwan Ruby C. Weng Department of Statistics National Chenechi University Taipei 116, Taiwan Abstract Pairwise coupling is a pop...
2003
4
2,441
Parameterized Novelty Detection for Environmental Sensor Monitoring Cynthia Archer, Todd K. Leen, Antonio Baptista OGI School of Science & Engineering Oregon Health & Science University 20000 N. W. Walker Road Beaverton, OR 97006 archer@cse.ogi.edu, tleen@cse.ogi.edu, baptista@ccalmr.ogi.edu Abstract ...
2003
40
2,442
Sensory Modality Segregation Virginia R. de Sa Department of Cognitive Science University of California, San Diego La Jolla, CA 92093-0515 desa@ucsd.edu Abstract Why are sensory modalities segregated the way they are? In this paper we show that sensory modalities are well designed for self-supervised ...
2003
41
2,443
Nonstationary Covariance Functions for Gaussian Process Regression Christopher J. Paciorek and Mark J. Schervish Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 paciorek@alumni.cmu.edu,mark@stat.cmu.edu Abstract We introduce a class of nonstationary covariance functions for Gaus...
2003
42
2,444
Algorithms for Interdependent Security Games Michael Kearns Luis E. Ortiz Department of Computer and Information Science University of Pennsylvania 1 Introduction Inspired by events ranging from 9/11 to the collapse of the accounting firm Arthur Andersen, economists Kunreuther and Heal [5] recently introdu...
2003
43
2,445
How to Combine Expert (or Novice) Advice when Actions Impact the Environment Daniela Pucci de Farias∗ Department of Mechanical Engineering Massachusetts Institute of Technology Cambridge, MA 02139 pucci@mit.edu Nimrod Megiddo IBM Almaden Research Center 650 Harry Road, K53-B2 San Jose, CA 95120 me...
2003
44
2,446
Reasoning about Time and Knowledge Neural-Symbolic Learning Systems Artur S. d' Avila Garcez" and Luis C. LambA "Dept. of Computing, City University London London, EC1V OHB, UK (aag@soi.city.ac.uk) ADept. of Computing Theory, PPGC-II-UFRGS Porto Alegre, RS 91501-970, Brazil (lamb@inf.ufrgs.br) Abst...
2003
45
2,447
Policy search by dynamic programming J. Andrew Bagnell Carnegie Mellon University Pittsburgh, PA 15213 Sham Kakade University of Pennsylvania Philadelphia, PA 19104 Andrew Y. Ng Stanford University Stanford, CA 94305 Jeff Schneider Carnegie Mellon University Pittsburgh, PA 15213 Abstract We ...
2003
46
2,448
A Holistic Approach to Compositional Semantics: a connectionist model and robot experiments Yuuya Sugita BSI, RIKEN Hirosawa 2-1, Wako-shi Saitama 3510198 JAPAN sugita@bdc.brain.riken.go.jp Jun Tani BSI, RIKEN Hirosawa 2-1, Wako-shi Saitama 3510198 JAPAN tani@bdc.brain.riken.go.jp Abstract W...
2003
47
2,449
Semidefinite relaxations for approximate inference on graphs with cycles Martin J. Wainwright Electrical Engineering and Computer Science UC Berkeley, Berkeley, CA 94720 wainwrig@eecs.berkeley.edu Michael I. Jordan Computer Science and Statistics UC Berkeley, Berkeley, CA 94720 jordan@cs.berkeley.edu ...
2003
48
2,450
Discriminating deformable shape classes S. Ruiz-Correa†, L. G. Shapiro†, M. Meil˘a‡ and G. Berson£ †Department of Electrical Engineering ‡Department of Statistics £Division of Medical Genetics, School of Medicine University of Washington, Seattle, WA 98105 Abstract We present and empirically test a novel ...
2003
49
2,451
Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons Thomas Natschl¨ager, Wolfgang Maass Institute for Theoretical Computer Science Technische Universitaet Graz A-8010 Graz, Austria {tnatschl, maass}@igi.tugraz.at Abstract We employ an efficient method using Bayesian a...
2003
5
2,452
Limiting form of the sample covariance eigenspectrum in PCA and kernel PCA David C. Hoyle & Magnus Rattray Department of Computer Science, University of Manchester, Manchester M13 9PL, UK. david.c.hoyle@man.ac.uk magnus@cs.man.ac.uk Abstract We derive the limiting form of the eigenvalue spectrum for s...
2003
50
2,453
Auction Mechanism Design for Multi-Robot Coordination Curt Bererton, Geoff Gordon, Sebastian Thrun, Pradeep Khosla {curt,ggordon,thrun,pkk}@cs.cmu.edu Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA 15217 Abstract The design of cooperative multi-robot systems is a highly active research area...
2003
51
2,454
A Computational Geometric Approach to Shape Analysis in Images Anuj Srivastava Department of Statistics Florida State University Tallahassee, FL 32306 anuj@stat.fsu.edu Washington Mio Department of Mathematics Florida State University Tallahassee, FL 32306 mio@math.fsu.edu Xiuwen Liu Departmen...
2003
52
2,455
A Low-Power Analog VLSI Visual Collision Detector Reid R. Harrison Department of Electrical and Computer Engineering University of Utah Salt Lake City, UT 84112 harrison@ece.utah.edu Abstract We have designed and tested a single-chip analog VL...
2003
53
2,456
An Improved Scheme for Detection and Labelling in Johansson Displays Claudio Fanti Computational Vision Lab, 136-93 California Institute of Technology Pasadena, CA 91125, USA fanti@vision.caltech.edu Marzia Polito Intel Corporation, SC12-303 2200 Mission College Blvd. Santa Clara, CA 95054, USA ma...
2003
54
2,457
1-norm Support Vector Machines Ji Zhu, Saharon Rosset, Trevor Hastie, Rob Tibshirani Department of Statistics Stanford University Stanford, CA 94305 {jzhu,saharon,hastie,tibs}@stat.stanford.edu Abstract The standard 2-norm SVM is known for its good performance in twoclass classi£cation. In this paper, we ...
2003
55
2,458
Envelope-based Planning in Relational MDPs Natalia H. Gardiol MIT AI Lab Cambridge, MA 02139 nhg@ai.mit.edu Leslie Pack Kaelbling MIT AI Lab Cambridge, MA 02139 lpk@ai.mit.edu Abstract A mobile robot acting in the world is faced with a large amount of sensory data and uncertainty in its action outco...
2003
56
2,459
Necessary Intransitive Likelihood-Ratio Classifiers Gang Ji and Jeff Bilmes SSLI-Lab, Department of Electrical Engineering University of Washington Seattle, WA 98195-2500 {gang,bilmes}@ee.washington.edu Abstract In pattern classification tasks, errors are introduced because of differences between the ...
2003
57
2,460
Simplicial Mixtures of Markov Chains: Distributed Modelling of Dynamic User Profiles Mark Girolami Department of Computing Science University of Glasgow Glasgow, UK girolami@dcs.gla.ac.uk Ata Kab´an School of Computer Science University of Birmingham Birmingham, UK a.kaban@cs.bham.ac.uk Abstract ...
2003
58
2,461
Bounded Finite State Controllers Pascal Poupart Department of Computer Science University of Toronto Toronto, ON M5S 3H5 ppoupart@cs.toronto.edu Craig Boutilier Department of Computer Science University of Toronto Toronto, ON M5S 3H5 cebly@cs.toronto.edu Abstract We describe a new approximation ...
2003
59
2,462
Mutual Boosting for Contextual Inference Michael Fink Pietro Perona Center for Neural Computation Electrical Engineering Department Hebrew University of Jerusalem California Institute of Technology Jerusalem, Israel 91904 Pasadena, CA 91125 fi...
2003
6
2,463
Sparseness of Support Vector Machines—Some Asymptotically Sharp Bounds Ingo Steinwart Modeling, Algorithms, and Informatics Group, CCS-3, Mail Stop B256 Los Alamos National Laboratory Los Alamos, NM 87545, USA ingo@lanl.gov Abstract The decision functions constructed by support vector machines (SVM’s) ...
2003
60
2,464
Towards social robots: Automatic evaluation of human-robot interaction by face detection and expression classification M.S. Bartlett , G. Littlewort , I. Fasel   , J. Chenu   , T. Kanda   , H. Ishiguro   , and J.R. Movellan   Institute for Neural Computati...
2003
61
2,465
Entrainment of Silicon Central Pattern Generators for Legged Locomotory Control Francesco Tenore1, Ralph Etienne-Cummings1,2, M. Anthony Lewis3 1Dept. of Electrical & Computer Eng., Johns Hopkins University, Baltimore, MD 21218 2Institute of Systems Research, University of Maryland, College Park, MD 207...
2003
62
2,466
Fast Embedding of Sparse Music Similarity Graphs John C. Platt Microsoft Research 1 Microsoft Way Redmond, WA 98052 USA jplatt@microsoft.com Abstract This paper applies fast sparse multidimensional scaling (MDS) to a large graph of music similarity, with 267K vertices that represent artists, albums, a...
2003
63
2,467
Online Passive-Aggressive Algorithms Koby Crammer Ofer Dekel Shai Shalev-Shwartz Yoram Singer School of Computer Science & Engineering The Hebrew University, Jerusalem 91904, Israel {kobics,oferd,shais,singer}@cs.huji.ac.il Abstract We present a unified view for online classification, regression, and un...
2003
64
2,468
Training a Quantum Neural Network Bob Ricks Department of Computer Science Brigham Young University Provo, UT 84602 cyberbob@cs.byu.edu Dan Ventura Department of Computer Science Brigham Young University Provo, UT 84602 ventura@cs.byu.edu Abstract Most proposals for quantum neural networks have ...
2003
65
2,469
Perspectives on Sparse Bayesian Learning David Wipf, Jason Palmer, and Bhaskar Rao Department of Electrical and Computer Engineering University of California, San Diego, CA 92092 dwipf,japalmer@ucsd.edu, brao@ece.ucsd.edu Abstract Recently, relevance vector machines (RVM) have been fashioned from a sp...
2003
66
2,470
One microphone blind dereverberation based on quasi-periodicity of speech signals Tomohiro Nakatani, Masato Miyoshi, and Keisuke Kinoshita Speech Open Lab., NTT Communication Science Labs., NTT Corporation 2-4, Hikaridai, Seika-cho, Soraku-gun, Kyoto, Japan {nak,miyo,kinoshita}@cslab.kecl.ntt.co.jp Abstract...
2003
67
2,471
Multiple Instance Learning via Disjunctive Programming Boosting Stuart Andrews Department of Computer Science Brown University, Providence, RI, 02912 stu@cs.brown.edu Thomas Hofmann Department of Computer Science Brown University, Providence, RI, 02912 th@cs.brown.edu Abstract Learning from ambigu...
2003
68
2,472
An Autonomous Robotic System For Mapping Abandoned Mines D. Ferguson1, A. Morris1, D. H¨ahnel2, C. Baker1, Z. Omohundro1, C. Reverte1 S. Thayer1, C. Whittaker1, W. Whittaker1, W. Burgard2, S. Thrun3 1The Robotics Institute 2Computer Science Department 3Computer Science Department Carnegie Mellon Universit...
2003
69
2,473
On the Dynamics of Boosting∗ Cynthia Rudin Ingrid Daubechies Princeton University Progr. Appl. & Comp. Math. Fine Hall Washington Road Princeton, NJ 08544-1000 {crudin,ingrid}@math.princeton.edu Robert E. Schapire Princeton University Department of Computer Science 35 Olden St. Princeton, NJ 0...
2003
7
2,474
Model Uncertainty in Classical Conditioning A. C. Courville*1,3, N. D. Daw2,3, G. J. Gordon4, and D. S. Touretzky2,3 1Robotics Institute, 2Computer Science Department, 3Center for the Neural Basis of Cognition, 4Center for Automated Learning and Discovery Carnegie Mellon University, Pittsburgh, PA 15213 {aa...
2003
70
2,475
Local Phase Coherence and the Perception of Blur Zhou Wang and Eero P. Simoncelli Howard Hughes Medical Institute Center for Neural Science and Courant Institute of Mathematical Sciences New York University, New York, NY 10003 zhouwang@ieee.org, eero.simoncelli@nyu.edu Humans are able to detect blurri...
2003
71
2,476
Efficient Exact k-NN and Nonparametric Classification in High Dimensions Ting Liu Computer Science Dept. Carnegie Mellon University Pittsburgh, PA 15213 tingliu@cs.cmu.edu Andrew W. Moore Computer Science Dept. Carnegie Mellon University Pittsburgh, PA 15213 awm@cs.cmu.edu Alexander Gray Compute...
2003
72
2,477
Large margin classifiers: convex loss, low noise, and convergence rates Peter L. Bartlett, Michael I. Jordan and Jon D. McAuliffe Division of Computer Science and Department of Statistics University of California, Berkeley Berkeley, CA 94720 {bartlett,jordan,jon}@stat.berkeley.edu Abstract Many classifica...
2003
73
2,478
Design of experiments via information theory ∗ Liam Paninski Center for Neural Science New York University New York, NY 10003 liam@cns.nyu.edu Abstract We discuss an idea for collecting data in a relatively efficient manner. Our point of view is Bayesian and information-theoretic: on any given trial, w...
2003
74
2,479
Minimax embeddings Matthew Brand Mitsubishi Electric Research Labs Cambridge MA 02139 USA Abstract Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. We introduce a more general ...
2003
75
2,480
Efficient and Robust Feature Extraction by Maximum Margin Criterion Haifeng Li Tao Jiang Department of Computer Science University of California Riverside, CA 92521 {hli,jiang}@cs.ucr.edu Keshu Zhang Department of Electrical Engineering University of New Orleans New Orleans, LA 70148 kzhang1@uno....
2003
76
2,481
Training fMRI Classifiers to Discriminate Cognitive States across Multiple Subjects Xuerui Wang, Rebecca Hutchinson, and Tom M. Mitchell Center for Automated Learning and Discovery Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA 15213 {xuerui.wang, rebecca.hutchinson, tom.mitchell}@cs.cmu.edu ...
2003
77
2,482
Applying Metric-Trees to Belief-Point POMDPs Joelle Pineau, Geoffrey Gordon School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 {jpineau,ggordon}@cs.cmu.edu Sebastian Thrun Computer Science Department Stanford University Stanford, CA 94305 thrun@stanford.edu Abstract Recen...
2003
78
2,483
Nonlinear Filtering of Electron Micrographs by Means of Support Vector Regression R. Vollgraf1, M. Scholz1, I. A. Meinertzhagen2, K. Obermayer1 1Department of Electrical Engineering and Computer Science Berlin University of Technology, Germany {vro,idefix,oby}@cs.tu-berlin.de 2Dalhousie University, Halifa...
2003
79
2,484
Distributed Optimization in Adaptive Networks Ciamac C. Moallemi Electrical Engineering Stanford University Stanford, CA 94305 ciamac@stanford.edu Benjamin Van Roy Management Science and Engineering and Electrical Engineering Stanford University Stanford, CA 94305 bvr@stanford.edu Abstract We ...
2003
8
2,485
Application of SVMs for Colour Classification and Collision Detection with AIBO Robots Michael J. Quinlan, Stephan K. Chalup and Richard H. Middleton∗ School of Electrical Engineering & Computer Science The University of Newcastle, Callaghan 2308, Australia {mquinlan,chalup,rick}@eecs.newcastle.edu.au Abstra...
2003
80
2,486
Warped Gaussian Processes Edward Snelson∗ Carl Edward Rasmussen† Zoubin Ghahramani∗ ∗Gatsby Computational Neuroscience Unit University College London 17 Queen Square, London WC1N 3AR, UK {snelson,zoubin}@gatsby.ucl.ac.uk †Max Planck Institute for Biological Cybernetics Spemann Straße 38, 72076 T¨ubing...
2003
81
2,487
Online Learning via Global Feedback for Phrase Recognition Xavier Carreras Llu´ıs M`arquez TALP Research Center, LSI Department Technical University of Catalonia (UPC) Campus Nord UPC, E–08034 Barcelona {carreras,lluism}@lsi.upc.es Abstract This work presents an architecture based on perceptrons to re...
2003
82
2,488
Iterative scaled trust-region learning in Krylov subspaces via Pearlmutter’s implicit sparse Hessian-vector multiply Eiji Mizutani Department of Computer Science Tsing Hua University Hsinchu, 300 TAIWAN R.O.C. eiji@wayne.cs.nthu.edu.tw James W. Demmel Mathematics and Computer Science University of C...
2003
83
2,489
AUC Optimization vs. Error Rate Minimization Corinna Cortes∗and Mehryar Mohri AT&T Labs – Research 180 Park Avenue, Florham Park, NJ 07932, USA {corinna, mohri}@research.att.com Abstract The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algo...
2003
84
2,490
Semi-Supervised Learning with Trees Charles Kemp, Thomas L. Griffiths, Sean Stromsten & Joshua B. Tenenbaum Department of Brain and Cognitive Sciences, MIT, Cambridge, MA 02139 {ckemp,gruffydd,sean s,jbt}@mit.edu Abstract We describe a nonparametric Bayesian approach to generalizing from few labeled examples...
2003
85
2,491
Finding the M Most Probable Configurations Using Loopy Belief Propagation Chen Yanover and Yair Weiss School of Computer Science and Engineering The Hebrew University of Jerusalem 91904 Jerusalem, Israel {cheny,yweiss}@cs.huji.ac.il Abstract Loopy belief propagation (BP) has been successfully used in a...
2003
86
2,492
A Nonlinear Predictive State Representation Matthew R. Rudary and Satinder Singh Computer Science and Engineering University of Michigan Ann Arbor, MI 48109 {mrudary,baveja}@umich.edu Abstract Predictive state representations (PSRs) use predictions of a set of tests to represent the state of controlled ...
2003
87
2,493
A Recurrent Model of Orientation Maps with Simple and Complex Cells Paul Merolla and Kwabena Boahen Department of Bioengineering University of Pennsylvania Philadelphia, PA 19104 {pmerolla,boahen} @seas.upenn.edu Abstract We describe a neuromorphic chip that utilizes transistor ...
2003
88
2,494
Predicting Speech Intelligibility from a Population of Neurons Jeff Bondy Ian C. Bruce Dept. of Electrical Engineering Dept. of Electrical Engineering McMaster University McMaster University Hamilton, ON Hamilton, ON jeff@soma.crl.mcmaster.ca ibruce@ieee.o...
2003
89
2,495
Statistical Debugging of Sampled Programs Alice X. Zheng EE Division UC Berkeley alicez@cs.berkeley.edu Michael I. Jordan CS Division and Department of Statistics UC Berkeley jordan@cs.berkeley.edu Ben Liblit CS Division UC Berkeley liblit@cs.berkeley.edu Alex Aiken CS Division UC Berkeley...
2003
9
2,496
Different Cortico-Basal Ganglia Loops Specialize in Reward Prediction on Different Time Scales Saori Tanaka Kenji Doya Nara Institute of Science and Technology ATR Computational Neuroscience Laboratories CREST, Japan Science and Technology Corporation Ky...
2003
90
2,497
Measure Based Regularization Olivier Bousquet, Olivier Chapelle, Matthias Hein Max Planck Institute for Biological Cybernetics, 72076 T¨ubingen, Germany {first.last}@tuebingen.mpg.de Abstract We address in this paper the question of how the knowledge of the marginal distribution P(x) can be incorporated in a...
2003
91
2,498
Geometric Clustering using the Information Bottleneck method Susanne Still Department of Physics Princeton Unversity, Princeton, NJ 08544 susanna@princeton.edu William Bialek Department of Physics Princeton Unversity, Princeton, NJ 08544 wbialek@princeton.edu L´eon Bottou NEC Laboratories America ...
2003
92
2,499
Sample Propagation Mark A. Paskin Computer Science Division University of California, Berkeley Berkeley, CA 94720 mark@paskin.org Abstract Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where cond...
2003
93