Sciweavers

364 search results - page 7 / 73
» On the generalization of soft margin algorithms
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ECSQARU
2009
Springer
13 years 6 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
TSP
2010
13 years 3 months ago
ARMA signals with specified symmetric marginal probability distribution
Except in the case of normal (i.e Gaussian) distribution, it is very difficult to calculate the marginal probability distribution of ARMA signals. By using a particular form of mo...
Bernard C. Picinbono
NIPS
2008
13 years 10 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
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 9 months ago
A Variational Inference Framework for Soft-In-Soft-Out Detection in Multiple Access Channels
We propose a unified framework for deriving and studying soft-in soft-out (SISO) detection in multiple-access channels using the concept of variational inference. The proposed fram...
Darryl Dexu Lin, Teng Joon Lim