Results 31 to 40 of about 273,287 (378)
Algorithms, 2010 We analytically investigate univariate C1 continuous cubic L1 interpolating splines calculated by minimizing an L1 spline functional based on the second derivative on 5-point windows.
Shu-Cherng Fang +2 more
doaj +1 more source
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity [PDF]
Neural Information Processing Systems, 2011 Although the standard formulations of prediction problems involve fully-observed and noiseless data drawn in an i.i.d. manner, many applications involve noisy and/or missing data, possibly involving dependence, as well.
Po-Ling Loh, M. Wainwright
semanticscholar +1 more source
Near Convexity, Metric Convexity, and Convexity
Rocky Mountain Journal of Mathematics, 2007 Many aspects of convexity in a normed space, hidden by the classical use of the obscure principle of excluded middle, are only revealed by a constructive approach. This paper studies various types of convexity, introducing several new concepts; it uses methods proposed by \textit{E.\,A.\thinspace Bishop} in Chapter~1 of ``A Constructivist Manifesto ...
openaire +3 more sources
Remarks on the abelian convexity theorem
, 2018 This note contains some observations on abelian convexity theorems. Convexity along an orbit is established in a very general setting using Kempf-Ness functions.
Biliotti, Leonardo, Ghigi, Alessandro
core +1 more source
Approximations by multivariate sublinear and Max-product operators under convexity
Demonstratio Mathematica, 2018 Here we search quantitatively under convexity the approximation of multivariate function by general multivariate positive sublinear operators with applications to multivariate Max-product operators.
Anastassiou George A.
doaj +1 more source
Damped Newton Stochastic Gradient Descent Method for Neural Networks Training
Mathematics, 2021 First-order methods such as stochastic gradient descent (SGD) have recently become popular optimization methods to train deep neural networks (DNNs) for good generalization; however, they need a long training time.
Jingcheng Zhou +3 more
doaj +1 more source
, 2007 We revisit and prove some convexity inequalities for trace functions conjectured in the earlier part I. The main functional considered is \Phi_{p,q}(A_1,A_2,...,A_m) = (trace((\sum_{j=1}^m A_j^p)^{q/p}))^{1/q} for m positive definite operators A_j.
A. Uhlmann +25 more
core +1 more source
Scoliosis convexity and organ anatomy are related
European spine journal, 2017 PurposePrimary ciliary dyskinesia (PCD) is a respiratory syndrome in which ‘random’ organ orientation can occur; with approximately 46% of patients developing situs inversus totalis at organogenesis.
T. Schlösser +6 more
semanticscholar +1 more source
The radius of convexity of normalized Bessel functions [PDF]
, 2015 The radius of convexity of two normalized Bessel functions of the first kind are determined in the case when the order is between -2 and -1. Our methods include the minimum principle for harmonic functions, the Hadamard factorization of some Dini ...
Á. Baricz, R. Szász
semanticscholar +1 more source
Convexity in Tree Spaces [PDF]
SIAM Journal on Discrete Mathematics, 2015 We study the geometry of metrics and convexity structures on the space of phylogenetic trees, which is here realized as the tropical linear space of all \ ultrametrics. The ${\rm CAT}(0)$-metric of Billera-Holmes-Vogtman arises from the theory of orthant
Bo Lin +3 more
semanticscholar +1 more source