Sciweavers

908 search results - page 16 / 182
» Interactive regret minimization
Sort
View
ESOP
2009
Springer
15 years 8 months ago
Minimization Algorithm for Symbolic Bisimilarity
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
Filippo Bonchi, Ugo Montanari
120
Voted
IROS
2007
IEEE
104views Robotics» more  IROS 2007»
15 years 8 months ago
Energy-field reconstruction for haptic-based molecular docking using energy minimization processes
— This paper presents a new method allowing haptic feedback in molecular docking simulations using a minimization process. These simulations, classically used by the pharmaceutic...
Bruno Daunay, Alain Micaelli, Stephane Régn...
NIPS
2008
15 years 3 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
123
Voted
JMLR
2010
161views more  JMLR 2010»
14 years 8 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
CHI
2007
ACM
16 years 2 months ago
Minimizing modality bias when exploring input preferences for multimodal systems in new domains: the archivus case study
In this paper we discuss the problems faced when trying to design an evaluation protocol for a multimodal system using novel input modalities and in a new domain. In particular, w...
Agnes Lisowska, Martin Rajman, Mireille Bét...