Results 101 to 110 of about 5,171,937 (249)
Strictly Conservative Neural Distance Fields
Computer Graphics Forum, EarlyView.Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley +1 more source
A Splitting Architecture for Exact Reduced Coulomb Friction
Computer Graphics Forum, EarlyView.Abstract Existing approaches to frictional contact dynamics typically either modify the Coulomb law to improve numerical robustness or solve the exact law in a fully coupled monolithic form. However, in its reduced form, exact Coulomb friction can be written as a cone complementarity problem with an augmented velocity, which reveals a natural split ...
Hongcheng Song +3 more
wiley +1 more source
A Non‐Parametric Framework for Correlation Functions on Product Metric Spaces
International Statistical Review, EarlyView.Summary We propose a non‐parametric framework for analysing data defined over products of metric spaces, a versatile class encountered in various fields. This framework accommodates non‐stationarity and seasonality and is applicable to both local and global domains, such as the Earth's surface, as well as domains evolving over linear time or time ...
Pier Giovanni Bissiri +3 more
wiley +1 more source
Copie-Buch von Geh.-Rath. Professor Dr. phil. R. Lipschitz Bonn. No. 1
, 1881 Enthält 38 Briefdurchschläge von Briefen Lipschitz' an verschiedene Adressaten, auf Durchschlagpapier. Gezählte Blätter 1-102, 146-147. Alphabetisches Register (unvollständig) Teilweise schlecht, teilweise nicht lesbar.Nachträglich gebunden, vermutlich ...
Lipschitz, Rudolf
core
A note on generalised information criteria for structured sparse models
International Statistical Review, EarlyView.Summary We propose a generalised information criteria ( gic) that accounts for sparsity pattern in the model. We obtain both asymptotic and nonasymptotic results for model selection. Moreover, we show that the gic is useful for selecting the regularisation parameter in regularised m$$ m $$ estimation in high‐dimensional scenarios.
Eduardo Fonseca Mendes +1 more
wiley +1 more source
, 2017 ABSTRAK. Diberikan ruang metrik dan lapangan (real atau kompleks). Suatu fungsi dikatakan fungsi Lipschitz bernilai skalar jika terdapat konstanta sedemikian sehingga Ruang Lipschitz adalah ruang dari semua fungsi Lipschitz terbatas bernilai skalar ...
Mulyaning Asih, Endang Cahya +2 more
core
A characterization of Bi-Lipschitz embeddable metric spaces in terms of local Bi-Lipschitz embeddability [PDF]
, 2011 We characterize uniformly perfect, complete, doubling metric spaces which embed bi-Lipschitzly into Euclidean space. Our result applies in particular to spaces of Grushin type equipped with Carnot-Carath ́eodory distance.
Seo, Jeehyeon
core
Factorization of Lipschitz operators on Banach function spaces
, 2018 [EN] Let (X,d) be a pointed metric space. Let T : X ¿ Y1(µ) and S : X ¿ Y2(µ) be two Lipschitz operators into two Banach function spaces Y1 and Y2 over the same finite measure µ.
Yahi, R. +9 more
core +1 more source
Fairness‐aware insurance pricing: A multi‐objective optimization approach
Journal of Risk and Insurance, EarlyView.Abstract Machine‐learning models can provide accurate predictions in insurance pricing, but can also increase disparities between protected groups. Existing fairness‐aware pricing approaches typically target one fairness notion at a time, making it difficult to compare trade‐offs between predictive accuracy, group fairness, individual fairness, and ...
Tim J. Boonen, Xinyue Fan, Zixiao Quan
wiley +1 more source