Sciweavers

1477 search results - page 48 / 296
» Random Convex Programs
Sort
View
LPNMR
2009
Springer
14 years 3 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
MP
2002
195views more  MP 2002»
13 years 8 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
JGO
2010
117views more  JGO 2010»
13 years 7 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
JMLR
2008
230views more  JMLR 2008»
13 years 8 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
ISSTA
2006
ACM
14 years 2 months ago
Object distance and its application to adaptive random testing of object-oriented programs
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...