Sciweavers

3837 search results - page 232 / 768
» Learning Approximate Consistencies
Sort
View
ECCC
2008
108views more  ECCC 2008»
15 years 7 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
JC
2010
117views more  JC 2010»
15 years 2 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
JMLR
2010
141views more  JMLR 2010»
15 years 2 months ago
Hierarchical Gaussian Process Regression
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
Sunho Park, Seungjin Choi
COLT
2005
Springer
16 years 22 days ago
Variations on U-Shaped Learning
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Fra...
ICML
2007
IEEE
16 years 8 months ago
Trust region Newton methods for large-scale logistic regression
Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method t...
Chih-Jen Lin, Ruby C. Weng, S. Sathiya Keerthi