A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Partial dependence curves (FPD) introduced by Friedman, are an important model interpretation tool, but are often not accessible to business analysts and scientists who typically lack the skills to choose, tune, and assess machine learning models. It is also common for the same partial dependence algorithm on the same …
In this paper, we prove that there exists a dimensional constant δ>0 such that given any background Kähler metric ω, the Calabi flow with initial data u0 satisfying \begin{equation*} \partial \bar \partial u_0 \in L^\infty (M) \text{ and } (1- δ)ω< ω_{u_0} < (1+δ)ω, \end{equation*} admits a unique short time so…
We present a simple, flexible, and general framework titled Partial Registration Network (PRNet), for partial-to-partial point cloud registration. Inspired by recently-proposed learning-based methods for registration, we use deep networks to tackle non-convexity of the alignment and partial correspondence problems. Whi…
Ranked data appear in many different applications, including voting and consumer surveys. There often exhibits a situation in which data are partially ranked. Partially ranked data is thought of as missing data. This paper addresses parameter estimation for partially ranked data under a (possibly) non-ignorable missing…
Differentiable relaxation for inferring partial orders from noisy linear data.
problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.
Study expands multiclass classification models with new rates and partial concept classes.
problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.
In this paper we consider the lens rigidity problem with partial data for conformal metrics in the presence of a magnetic field on a compact manifold of dimension ≥3 with boundary. We show that one can uniquely determine the conformal factor and the magnetic field near a strictly convex (with respect to the magne…
We introduce physics informed neural networks -- neural networks that are trained to solve supervised learning tasks while respecting any given law of physics described by general nonlinear partial differential equations. In this two part treatise, we present our developments in the context of solving two main classes …
In this paper, we propose a mixture of probabilistic partial canonical correlation analysis (MPPCCA) that extracts the Causal Patterns from two multivariate time series. Causal patterns refer to the signal patterns within interactions of two elements having multiple types of mutually causal relationships, rather than a…
Develops a regression model for partially observed dynamic tensor data.
problem Characterizing the relationship between dynamic tensor data and external covariates when data is only partially observed.
method Introduces low-rank, sparsity, and fusion structures on the regression coefficient tensor, and uses a loss function projected over observed entries. Developed an efficient non-convex alternating updating algorithm.
result Derived finite-sample error bounds for the estimator.
For a Riemannian manifold (M,g) with strictly convex boundary ∂M, the lens data consists in the set of lengths of geodesics γ with endpoints on ∂M, together with their endpoints (x−,x+)∈∂M×∂M and tangent exit vectors (v−,v+)∈Tx−M×Tx+M. We show …