Results 11 to 20 of about 85,494 (314)

Optimal computational and statistical rates of convergence for sparse nonconvex learning problems

open access: yesThe Annals of Statistics, 2014
We provide theoretical analysis of the statistical and computational properties of penalized $M$-estimators that can be formulated as the solution to a possibly nonconvex optimization problem. Many important estimators fall in this category, including least squares regression with nonconvex regularization, generalized linear models with nonconvex ...
Wang, Zhaoran, Liu, Han, Zhang, Tong
openaire   +7 more sources

Computational complexity versus statistical performance on sparse recovery problems [PDF]

open access: yesInformation and Inference: A Journal of the IMA, 2019
Abstract We show that several classical quantities controlling compressed-sensing performance directly match classical parameters controlling algorithmic complexity. We first describe linearly convergent restart schemes on first-order methods solving a broad range of compressed-sensing problems, where sharpness at the optimum controls
Roulet, Vincent   +2 more
openaire   +3 more sources

Inequalities involving hypergeometric and related functions

open access: yesJournal of Inequalities and Applications, 2018
An inequality is being proved which is connected to cost-effective numerical density estimation of the hyper-gamma probability distribution. The left-hand side of the inequality is a combination of two in the third parameter distinct versions of the ...
Siegfried H. Lehnigk
doaj   +1 more source

Computer supported collaborative learning in problem-based learning of statistics [PDF]

open access: yes2012 International Conference on Multimedia Computing and Systems, 2012
This study investigated computer supported collaborative learning in the Web-based learning environment designed using the constructivist Problem-Based Learning (PBL) approach. One group of students was exposed to the constructivist PBL Web-based learning whilst another group was exposed to traditional PBL learning approach.
Rohani Ahmad Tarmizi   +3 more
openaire   +1 more source

A sequential smoothing algorithm with linear computational cost. [PDF]

open access: yes, 2010
In this paper we propose a new particle smoother that has a computational complexity of O(N), where N is the number of particles. This compares favourably with the O(N2) computational cost of most smoothers.
Fearnhead, Paul   +5 more
core   +1 more source

Algebraic statistics in practice: applications to networks [PDF]

open access: yes, 2020
Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra, and computational algebra), geometry, and combinatorics to provide insight into knotty problems in mathematical statistics.
Casanellas Rius, Marta   +3 more
core   +1 more source

Information Theory in Computational Biology: Where We Stand Today

open access: yesEntropy, 2020
“A Mathematical Theory of Communication” was published in 1948 by Claude Shannon to address the problems in the field of data compression and communication over (noisy) communication channels.
Pritam Chanda   +5 more
doaj   +1 more source

A short history of algebraic statistics [PDF]

open access: yes, 2008
In algebraic statistics, computational techniques from algebraic geometry become tools to address statistical problems. This, in turn, may prompt research in algebraic geometry. The basic ideas at the core of algebraic statistics will be presented. In
Eva Riccomagno, Riccomagno, Eva
core   +1 more source

Statistical Resolution Limit Analysis of Two Closely Spaced Signal Sources Using Rao Test

open access: yesIEEE Access, 2017
High computational complexity and difficulty in taking an analytical expression of detection statistics are some of the problems encountered when using the statistical resolution limit (SRL) analysis in the generalized likelihood ratio test (GLRT). A Rao
Minhong Sun   +3 more
doaj   +1 more source

INFORMATICS, COMPUTER ENGINEERING AND MANAGEMENT

open access: yesСовременная наука и инновации, 2022
The paper considers several combinatorial and optimization problems in Big Data systems, including the computational complexity of finding functional dependencies in the subject area and constructing a data schema, the number of combinations for ...
A. V. Malikov
doaj   +1 more source

Home - About - Disclaimer - Privacy