搜索结果: 1-6 共查到“管理学 convexity”相关记录6条 . 查询时间(0.083 秒)
Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
Adaptivity averaged stochastic gradient descent local strong convexity logistic regression
2013/4/28
In this paper, we consider supervised learning problems such as logistic regression and study the stochastic gradient method with averaging, in the usual stochastic approximation setting where observa...
Neyman-Pearson classification, convexity and stochastic constraints
binary classifi cation Neyman-Pearson paradigm anomaly detection stochastic constraint convexity empirical risk minimization chance constrained optimization
2011/3/25
Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of c...
On the Non-Convexity of the Time Constant in First-Passage Percolation
First-passage percolation timeconstant convexity
2009/5/11
We give a counterexample to a conjecture of Hammersley and Welsh (1965) about the convexity of the time constant in first-passage percolation, as a functional on the space of distribution functions. T...
Brownian couplings,convexity,and shy-ness
Brownian motion co-adapted coupling convexity coupling Markovian coupling perverse coupling stochastic differential
2009/5/7
Benjamini, Burdzy and Chen (2007) introduced the notion of a shy coupling: a coupling of a Markov process such that, for suitable starting points, there is a positive chance of the two component proce...
Brownian couplings, convexity, and shy-ness
Brownian motion co-adapted coupling convexity coupling Markovian coupling perversecoupling reflection coupling
2009/4/29
Benjamini, Burdzy and Chen (2007) introduced the notion of a shy coupling: a coupling of a Markov process such that, for suitable starting points, there is a positive chance of the two component proce...
Benjamini, Burdzy and Chen (2007) introduced the notion of a shy coupling: a coupling of a Markov process such that, for suitable starting points, there is a positive chance of the two component proce...