759 search results - page 96 / 152 » Structured Learning with Approximate Inference |
104
click to vote
AIPS
2007
15 years 3 months ago
2007
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
147
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
137
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
104
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
135
click to vote
JCSS
2008
15 years 1 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...