Sciweavers

172 search results - page 30 / 35
» Learning to Predict Code-Switching Points
Sort
View
COLT
2006
Springer
13 years 10 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
BC
2002
108views more  BC 2002»
13 years 6 months ago
Spike-timing-dependent plasticity: common themes and divergent vistas
Abstract. Recent experimental observations of spiketiming-dependent synaptic plasticity (STDP) have revitalized the study of synaptic learning rules. The most surprising aspect of ...
Ádám Kepecs, Mark C. W. van Rossum, ...
COLT
2008
Springer
13 years 8 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
ICPR
2010
IEEE
13 years 7 months ago
Spatiotemporal-Boosted DCT Features for Head and Face Gesture Analysis
Automatic analysis of head gestures and facial expressions is a challenging research area and it has significant applications in humancomputer interfaces. In this study, facial la...
Hatice Çinar Akakin, Bülent Sankur
ICASSP
2011
IEEE
12 years 10 months ago
Application specific loss minimization using gradient boosting
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
Bin Zhang, Abhinav Sethy, Tara N. Sainath, Bhuvana...