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.
This paper provides estimation and inference methods for an identified set's boundary (i.e., support function) where the selection among a very large number of covariates is based on modern regularized tools. I characterize the boundary using a semiparametric moment equation. Combining Neyman-orthogonality and sample s…
We consider the finite sample properties of the regularized high-dimensional Cox regression via lasso. Existing literature focuses on linear models or generalized linear models with Lipschitz loss functions, where the empirical risk functions are the summations of independent and identically distributed (iid) losses. T…
This paper studies the question of filtering and maximizing terminal wealth from expected utility in a partially information stochastic volatility models. The special features is that the only information available to the investor is the one generated by the asset prices, and the unobservable processes will be modeled …
On any space-like W-surface in the three-dimensional Minkowski space we introduce locally natural principal parameters and prove that such a surface is determined uniquely up to motion by a special invariant function, which satisfies a natural non-linear partial differential equation. This result can be interpreted as …
We establish Schauder a priori estimates and regularity for solutions to a class of boundary-degenerate elliptic linear second-order partial differential equations. Furthermore, given a smooth source function, we prove regularity of solutions up to the portion of the boundary where the operator is degenerate. Degenerat…
Quantitative modeling of post-transcriptional regulation process is a challenging problem in systems biology. A mechanical model of the regulatory process needs to be able to describe the available spatio-temporal protein concentration and mRNA expression data and recover the continuous spatio-temporal fields. Rigorous…
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.
We study time-like surfaces in the three-dimensional Minkowski space with diagonalizable second fundamental form. On any time-like W-surface we introduce locally natural principal parameters and prove that such a surface is determined uniquely (up to motion) by a special invariant function, which satisfies a natural no…
The intrinsic geometric properties of generalized Darboux-Manakov-Zakharov systems of semilinear partial differential equations \label{GDMZabstract} \frac{\partial^2 u}{\partial x_i\partial x_j}=f_{ij}\Big(x_k,u,\frac{\partial u}{\partial x_l}\Big), 1\leq i<j\leq n, k,l\in\{1,...,n\} for a real-valued function $u(x_1,.…
Among interpretable machine learning methods, the class of Generalised Additive Neural Networks (GANNs) is referred to as Self-Explaining Neural Networks (SENN) because of the linear dependence on explicit functions of the inputs. In binary classification this shows the precise weight that each input contributes toward…
We propose learning deep models that are monotonic with respect to a user-specified set of inputs by alternating layers of linear embeddings, ensembles of lattices, and calibrators (piecewise linear functions), with appropriate constraints for monotonicity, and jointly training the resulting network. We implement the l…
Partial Wasserstein Covering aims to identify missing patterns in datasets.
problem Identifying missing patterns in datasets compared to actual applications.
method Formulated as a discrete optimization problem with partial Wasserstein divergence. Proved submodular, allowing greedy approximation. Proposed quasi-greedy algorithms with acceleration techniques.
result Efficiently fills gaps and finds missing scenes in real driving scenes datasets.
We study the problem of regret minimization in partially observable linear quadratic control systems when the model dynamics are unknown a priori. We propose ExpCommit, an explore-then-commit algorithm that learns the model Markov parameters and then follows the principle of optimism in the face of uncertainty to desig…
Graph Neural Nets (GNNs) have received increasing attentions, partially due to their superior performance in many node and graph classification tasks. However, there is a lack of understanding on what they are learning and how sophisticated the learned graph functions are. In this work, we propose a dissection of GNNs …
These lecture notes are concerned with the solvability of the second boundary value problem of the prescribed affine mean curvature equation and related regularity theory of the Monge-Ampère and linearized Monge-Ampère equations. The prescribed affine mean curvature equation is a fully nonlinear, fourth order, geometri…