Results 11 to 20 of about 22,170,122 (349)
Convergence of online learning algorithm with a parameterized loss
AIMS Mathematics, 2022 The research on the learning performance of machine learning algorithms is one of the important contents of machine learning theory, and the selection of loss function is one of the important factors affecting the learning performance.
Shuhua Wang
doaj +1 more source
New Journal of Physics, 2023 Motivated by the Penrose–Onsager criterion for Bose–Einstein condensation we propose a functional theory for targeting low-lying excitation energies of bosonic quantum systems through the one-particle picture.
Julia Liebert, Christian Schilling
doaj +1 more source
Near-Convex Archetypal Analysis [PDF]
IEEE Signal Processing Letters, 2020 Nonnegative matrix factorization (NMF) is a widely used linear dimensionality reduction technique for nonnegative data. NMF requires that each data point is approximated by a convex combination of basis elements. Archetypal analysis (AA), also referred to as convex NMF, is a well-known NMF variant imposing that the basis elements are themselves convex ...
Pierre De Handschutter +3 more
openaire +3 more sources
AutoBar: Automatic Barrier Coverage Formation for Danger Keep Out Applications in Smart City
Sensors, 2023 Barrier coverage is a fundamental application in wireless sensor networks, which are widely used for smart cities. In applications, the sensors form a barrier for the intruders and protect an area through intrusion detection.
Ying Shao +8 more
doaj +1 more source
Convex analysis and thermodynamics [PDF]
Kinetic & Related Models, 2013 Convex analysis is very useful to prove that a material model fulfills the second law of thermodynamics. Dissipation must remains non-negative and an elegant way to ensure this property is to construct an appropriate pseudo-potential of dissipation.
Point, Nelly, Erlicher, Silvano
openaire +3 more sources
Sparse Regularization via Convex Analysis [PDF]
IEEE Transactions on Signal Processing, 2017 Sparse approximate solutions to linear equations are classically obtained via L1 norm regularized least squares, but this method often underestimates the true solution.
I. Selesnick
semanticscholar +1 more source
Mathematical Programming, 2014 International ...
Combettes, Patrick Louis +2 more
openaire +4 more sources
General optimal euclidean Sobolev and Gagliardo-Nirenberg inequalities
Anais da Academia Brasileira de Ciências, 2005 We prove general optimal euclidean Sobolev and Gagliardo-Nirenberg inequalities by using mass transportation and convex analysis results. Explicit extremals and the computation of some optimal constants are also provided.
Jurandir Ceccon, Marcos Montenegro
doaj +1 more source
A convex approach to hydrodynamic analysis [PDF]
2015 54th IEEE Conference on Decision and Control (CDC), 2015 Preliminary version submitted to 54rd IEEE Conference on Decision and Control, Dec.
Antonis Papachristodoulou +2 more
openaire +3 more sources
Convexity in Real Analysis [PDF]
Real Analysis Exchange, 2011 We treat the classical notion of convexity in the context of hard real analysis. Definitions of the concept are given in terms of defining functions and quadratic forms, and characterizations are provided of different concrete notions of convexity. This analytic notion of convexity is related to more classical geometric ideas.
openaire +4 more sources