NIPS 2007 - PDF Preprint Papers

NIPS 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NIPS-2007 Paper

click to vote

NIPS
2007

278views Information Technology» more NIPS 2007»

Unconstrained On-line Handwriting Recognition with Recurrent Neural Networks

13 years 6 months ago

Download books.nips.cc

In online handwriting recognition the trajectory of the pen is recorded during writing. Although the trajectory provides a compact and complete representation of the written outpu...

Alex Graves, Santiago Fernández, Marcus Liw...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	278	Unconstrained On-line Handwriting Recognition with Recurrent Neural Networks	claim
2	272	Predicting human gaze using low-level saliency combined with face detection	claim
3	267	People Tracking with the Laplacian Eigenmaps Latent Variable Model	claim
4	262	Congruence between model and human attention reveals unique signatures of critical visual events	claim
5	248	Combined discriminative and generative articulated pose and non-rigid shape estimation	claim
6	232	The Tradeoffs of Large Scale Learning	claim
7	220	Multiple-Instance Active Learning	claim
8	217	Semi-Supervised Multitask Learning	claim
9	208	Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations	claim
10	207	Bayes-Adaptive POMDPs	claim
11	202	A New View of Automatic Relevance Determination	claim
12	201	Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition	claim
13	200	Receptive Fields without Spike-Triggering	claim
14	199	Discriminative Log-Linear Grammars with Latent Variables	claim
15	192	Statistical Analysis of Semi-Supervised Regression	claim
16	190	Sparse Feature Learning for Deep Belief Networks	claim
17	190	Bayesian Inference for Spiking Neuron Models with a Sparsity Prior	claim
18	189	Learning the structure of manifolds using random projections	claim
19	188	A Spectral Regularization Framework for Multi-Task Structure Learning	claim
20	188	Discriminative Batch Mode Active Learning	claim
21	187	Regularized Boost for Semi-Supervised Learning	claim
22	186	Distributed Inference for Latent Dirichlet Allocation	claim
23	185	Nearest-Neighbor-Based Active Learning for Rare Category Detection	claim
24	182	Predicting Brain States from fMRI Data: Incremental Functional Principal Component Regression	claim
25	180	Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms	claim
26	179	SpAM: Sparse Additive Models	claim
27	178	Learning Visual Attributes	claim
28	178	Supervised Topic Models	claim
29	176	Random Features for Large-Scale Kernel Machines	claim
30	174	Object Recognition by Scene Alignment	claim
31	173	HM-BiTAM: Bilingual Topic Exploration, Word Alignment, and Translation	claim
32	173	A Constraint Generation Approach to Learning Stable Linear Dynamical Systems	claim
33	172	A Kernel Statistical Test of Independence	claim
34	171	Locality and low-dimensions in the prediction of natural experience from fMRI	claim
35	171	Continuous Time Particle Filtering for fMRI	claim
36	170	Theoretical Analysis of Heuristic Search Methods for Online POMDPs	claim
37	170	What makes some POMDP problems easy to approximate?	claim
38	170	Bayesian Co-Training	claim
39	169	Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity	claim
40	168	Invariant Common Spatial Patterns: Alleviating Nonstationarities in Brain-Computer Interfacing	claim
41	167	Sparse Overcomplete Latent Variable Decomposition of Counts Data	claim
42	167	A General Boosting Method and its Application to Learning Ranking Functions for Web Search	claim
43	166	Unsupervised Feature Selection for Accurate Recommendation of High-Dimensional Image Data	claim
44	166	Mining Internet-Scale Software Repositories	claim
45	166	Spatial Latent Dirichlet Allocation	claim
46	165	Gaussian Process Models for Link Analysis and Transfer Learning	claim
47	165	Expectation Maximization and Posterior Constraints	claim
48	164	Incremental Natural Actor-Critic Algorithms	claim
49	162	Bundle Methods for Machine Learning	claim
50	161	Density Estimation under Independent Similarly Distributed Sampling Assumptions	claim
51	161	The discriminant center-surround hypothesis for bottom-up saliency	claim
52	160	Discriminative Keyword Selection Using Support Vector Machines	claim
53	159	Active Preference Learning with Discrete Choice Data	claim
54	158	Agreement-Based Learning	claim
55	158	Linear programming analysis of loopy belief propagation for weighted matching	claim
56	158	Reinforcement Learning in Continuous Action Spaces through Sequential Monte Carlo Methods	claim
57	156	An Analysis of Convex Relaxations for MAP Estimation	claim
58	156	An Analysis of Inference with the Universum	claim
59	155	Boosting Algorithms for Maximizing the Soft Margin	claim
60	155	Modelling motion primitives and their timing in biologically executed movements	claim
61	155	Using Deep Belief Nets to Learn Covariance Kernels for Gaussian Processes	claim
62	154	Cooled and Relaxed Survey Propagation for MRFs	claim
63	154	Automatic Generation of Social Tags for Music Recommendation	claim
64	153	Contraction Properties of VLSI Cooperative Competitive Neural Networks of Spiking Neurons	claim
65	153	The Generalized FITC Approximation	claim
66	153	An online Hebbian learning rule that performs Independent Component Analysis	claim
67	153	Convex Learning with Invariances	claim
68	152	Collapsed Variational Inference for HDP	claim
69	152	Modeling homophily and stochastic equivalence in symmetric relational data	claim
70	150	DIFFRAC: a discriminative and flexible framework for clustering	claim
71	150	Collective Inference on Markov Models for Modeling Bird Migration	claim
72	150	Competition Adds Complexity	claim
73	149	New Outer Bounds on the Marginal Polytope	claim
74	149	A Bayesian Model of Conditioned Perception	claim
75	149	Online Linear Regression and Its Application to Model-Based Reinforcement Learning	claim
76	148	Regret Minimization in Games with Incomplete Information	claim
77	147	Convex Relaxations of Latent Variable Training	claim
78	147	Direct Importance Estimation with Model Selection and Its Application to Covariate Shift Adaptation	claim
79	147	TrueSkill Through Time: Revisiting the History of Chess	claim
80	147	How SVMs can estimate quantiles and the median	claim
81	147	Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis	claim
82	147	An in-silico Neural Model of Dynamic Routing through Neuronal Coherence	claim
83	146	Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs	claim
84	146	Anytime Induction of Cost-sensitive Trees	claim
85	146	Probabilistic Matrix Factorization	claim
86	146	Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations	claim
87	146	Receding Horizon Differential Dynamic Programming	claim
88	145	Evaluating Search Engines by Modeling the Relationship Between Relevance and Clicks	claim
89	145	Subspace-Based Face Recognition in Analog VLSI	claim
90	145	Comparing Bayesian models for multisensory cue combination without mandatory integration	claim
91	144	EEG-Based Brain-Computer Interaction: Improved Accuracy by Automatic Single-Trial Error Detection	claim
92	144	Robust Regression with Twinned Gaussian Processes	claim
93	143	Near-Maximum Entropy Models for Binary Neural Representations of Natural Images	claim
94	143	Stability Bounds for Non-i.i.d. Processes	claim
95	143	A Game-Theoretic Approach to Apprenticeship Learning	claim
96	142	Multi-Task Learning via Conic Programming	claim
97	142	Hierarchical Apprenticeship Learning with Application to Quadruped Locomotion	claim
98	142	Topmoumoute Online Natural Gradient Algorithm	claim
99	140	Learning with Tree-Averaged Densities and Distributions	claim
100	139	Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria	claim
101	138	Inferring Neural Firing Rates from Spike Trains Using Gaussian Processes	claim
102	138	Local Algorithms for Approximate Inference in Minor-Excluded Graphs	claim
103	138	Bayesian Agglomerative Clustering with Coalescents	claim
104	137	Markov Chain Monte Carlo with People	claim
105	137	Modeling image patches with a directed hierarchy of Markov random fields	claim
106	137	Privacy-Preserving Belief Propagation and Sampling	claim
107	137	Sequential Hypothesis Testing under Stochastic Deadlines	claim
108	137	Kernels on Attributed Pointsets with Applications	claim
109	136	Learning Bounds for Domain Adaptation	claim
110	136	A learning framework for nearest neighbor search	claim
111	136	Fast Variational Inference for Large-scale Internet Diagnosis	claim
112	136	Augmented Functional Time Series Representation and Forecasting with Gaussian Processes	claim
113	136	Boosting the Area under the ROC Curve	claim
114	135	The Price of Bandit Information for Online Optimization	claim
115	135	Catching Change-points with Lasso	claim
116	135	Discovering Weakly-Interacting Factors in a Complex Stochastic Process	claim
117	135	Random Projections for Manifold Learning	claim
118	135	Computing Robust Counter-Strategies	claim
119	134	Discriminative K-means for Clustering	claim
120	134	On Sparsity and Overcompleteness in Image Models	claim
121	134	A probabilistic model for generating realistic lip movements from speech	claim
122	134	A Randomized Algorithm for Large Scale Support Vector Learning	claim
123	134	Convex Clustering with Exemplar-Based Models	claim
124	133	A Probabilistic Approach to Language Change	claim
125	133	Managing Power Consumption and Performance of Computing Systems Using Reinforcement Learning	claim
126	133	Predictive Matrix-Variate t Models	claim
127	133	Selecting Observations against Adversarial Objectives	claim
128	132	A general agnostic active learning algorithm	claim
129	132	Neural characterization in partially observed populations of spiking neurons	claim
130	131	Testing for Homogeneity with Kernel Fisher Discriminant Analysis	claim
131	131	Parallelizing Support Vector Machines on Distributed Computers	claim
132	131	Measuring Neural Synchrony by Message Passing	claim
133	129	Cluster Stability for Finite Samples	claim
134	128	A Bayesian Framework for Cross-Situational Word-Learning	claim
135	128	Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization	claim
136	127	Adaptive Online Gradient Descent	claim
137	127	On higher-order perceptron algorithms	claim
138	126	Modeling Natural Sounds with Modulation Cascade Processes	claim
139	126	The Distribution Family of Similarity Distances	claim
140	125	Variational inference for Markov jump processes	claim
141	125	A neural network implementing optimal state estimation based on dynamic spike train decoding	claim
142	124	Kernel Measures of Conditional Dependence	claim
143	124	Variational Inference for Diffusion Processes	claim
144	124	Random Sampling of States in Dynamic Programming	claim
145	124	One-Pass Boosting	claim
146	124	A Risk Minimization Principle for a Class of Parzen Estimators	claim
147	123	Catching Up Faster in Bayesian Model Selection and Model Averaging	claim
148	123	Colored Maximum Variance Unfolding	claim
149	122	Second Order Bilinear Discriminant Analysis for single trial EEG analysis	claim
150	122	Structured Learning with Approximate Inference	claim
151	122	Retrieved context and the discovery of semantic structure	claim
152	121	Estimating disparity with confidence from energy neurons	claim
153	121	The Noisy-Logical Distribution and its Application to Causal Inference	claim
154	121	Feature Selection Methods for Improving Protein Structure Prediction with Rosetta	claim
155	120	Fitted Q-iteration in continuous action-space MDPs	claim
156	119	On Ranking in Survival Analysis: Bounds on the Concordance Index	claim
157	119	Bayesian Policy Learning with Trans-Dimensional MCMC	claim
158	119	Consistent Minimization of Clustering Objective Functions	claim
159	119	Hierarchical Penalization	claim
160	119	Learning Horizontal Connections in a Sparse Coding Model of Natural Images	claim
161	118	Optimal models of sound localization by barn owls	claim
162	118	Non-parametric Modeling of Partially Ranked Data	claim
163	118	CPR for CSPs: A Probabilistic Relaxation of Constraint Propagation	claim
164	117	Compressed Regression	claim
165	116	Multi-task Gaussian Process Prediction	claim
166	116	Learning with Transformation Invariant Kernels	claim
167	116	A Bayesian LDA-based model for semi-supervised part-of-speech tagging	claim
168	115	Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing	claim
169	115	Infinite State Bayes-Nets for Structured Domains	claim
170	110	Progressive mixture rules are deviation suboptimal	claim
171	110	Learning to classify complex patterns using a VLSI network of spiking neurons	claim
172	110	Heterogeneous Component Analysis	claim
173	109	Learning and using relational theories	claim
174	109	Exponential Family Predictive Representations of State	claim
175	106	Extending position/phase-shift tuning to motion energy neurons improves velocity discrimination	claim
176	106	Inferring Elapsed Time from Stochastic Neural Processes	claim
177	106	Learning the 2-D Topology of Images	claim
178	106	Loop Series and Bethe Variational Bounds in Attractive Graphical Models	claim
179	104	Hippocampal Contributions to Control: The Third Way	claim
180	103	Sparse deep belief net model for visual area V2	claim
181	100	Experience-Guided Search: A Theory of Attentional Control	claim
182	86	Temporal Difference Updating without a Learning Rate	claim
183	80	Stable Dual Dynamic Programming	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers