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.
The paper extends risk measures to two-step approximations and studies log-concave distributions.
This paper tackles discontinuous neural networks for better approximation of piecewise continuous functions.
For massive data, the family of subsampling algorithms is popular to downsize the data volume and reduce computational burden. Existing studies focus on approximating the ordinary least squares estimate in linear regression, where statistical leverage scores are often used to define subsampling probabilities. In this p…
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an edge-by-edge correction. The approach leads to an intuitive framework in which o…
We present and analyze a simple, two-step algorithm to approximate the optimal solution of the sparse PCA problem. Our approach first solves a L1 penalized version of the NP-hard sparse PCA optimization problem and then uses a randomized rounding strategy to sparsify the resulting dense solution. Our main theoretical r…
The paper extends two-step homogeneous geodesics to homogeneous Finsler spaces.
Classifies two-step solvable Lie groups with SKT structures.
We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the graphs from which they arise are isomorphic.
Efficiently optimizes constrained problems with two-step lookahead BO.
Paper introduces new actuarial-consistent valuations for insurance liabilities.
Proves conjecture about compatible SKT and balanced metrics on compact solvmanifolds.
Patch priors have become an important component of image restoration. A powerful approach in this category of restoration algorithms is the popular Expected Patch Log-Likelihood (EPLL) algorithm. EPLL uses a Gaussian mixture model (GMM) prior learned on clean image patches as a way to regularize degraded patches. In th…
We prove that two-step analytic sub-Riemannian structures on a compact analytic manifold equipped with a smooth measure and Lipschitz Carnot groups satisfy measure contraction properties.
In graph-based active learning, algorithms based on expected error minimization (EEM) have been popular and yield good empirical performance. The exact computation of EEM optimally balances exploration and exploitation. In practice, however, EEM-based algorithms employ various approximations due to the computational ha…
A Riemannian Einstein solvmanifold (possibly, any noncompact homogeneous Einstein space) is almost completely determined by the nilradical of its Lie algebra. A nilpotent Lie algebra, which can serve as the nilradical of an Einstein metric solvable Lie algebra, is called an Einstein nilradical. Despite a substantial pr…
We bound the higher-order Dehn functions and other filling invariants of certain Carnot groups using approximation techniques. These groups include the higher-dimensional Heisenberg groups, jet groups, and central products of two-step nilpotent groups. Some consequences of this work are a construction of groups with ar…
New variational method solves submodular maximum coverage problem efficiently.
Clustering analysis by nonnegative low-rank approximations has achieved remarkable progress in the past decade. However, most approximation approaches in this direction are still restricted to matrix factorization. We propose a new low-rank learning method to improve the clustering performance, which is beyond matrix f…
The paper projects unknown manifolds onto hyperspheres for efficient function approximation.
Behavior of the entropy numbers of classes of multivariate functions with mixed smoothness is studied here. This problem has a long history and some fundamental problems in the area are still open. The main goal of this paper is to develop a new method of proving the upper bounds for the entropy numbers. This method is…
Large sample size brings the computation bottleneck for modern data analysis. Subsampling is one of efficient strategies to handle this problem. In previous studies, researchers make more fo- cus on subsampling with replacement (SSR) than on subsampling without replacement (SSWR). In this paper we investigate a kind of…
We associate a two-step nilpotent Lie algebra to an arbitrary Schreier graph. We then use properties of the Schreier graph to determine necessary and sufficient conditions for this Lie algebra to extend to a three-step nilpotent Lie algebra. As an application, if we start with pairs of non-isomorphic Schreier graphs co…
Estimation of density derivatives is a versatile tool in statistical data analysis. A naive approach is to first estimate the density and then compute its derivative. However, such a two-step approach does not work well because a good density estimator does not necessarily mean a good density-derivative estimator. In t…
A two-step nonparametric method estimates financial systemic risk.
A conjugate Bayesian method detects change points in Hawkes processes efficiently.
In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study, instead of the single optimal solution, we consider finding a set of diverse yet nea…
A new two-step LSMC method improves game option pricing accuracy.
Two-step conformal prediction method for adaptive bounding box uncertainties in multi-object detection.
A new two-step MH method for Bayesian EL computation.
The paper discusses a new method for constructing two-step Darboux transforms of isothermic surfaces.
Develops neural network framework for risk-reward optimization problems.
We propose a hybrid approach aimed at improving the sample efficiency in goal-directed reinforcement learning. We do this via a two-step mechanism where firstly, we approximate a model from Model-Free reinforcement learning. Then, we leverage this approximate model along with a notion of reachability using Mean First P…
A new Bayesian method optimizes time-dependent expensive functions with lookahead.
This paper presents a simulator-assisted training method (SimVAE) for variational autoencoders (VAE) that leads to a disentangled and interpretable latent space. Training SimVAE is a two-step process in which first a deep generator network(decoder) is trained to approximate the simulator. During this step, the simulato…
We consider evaluation methods for payoffs with an inherent financial risk as encountered for instance for portfolios held by pension funds and insurance companies. Pricing such payoffs in a way consistent to market prices typically involves combining actuarial techniques with methods from mathematical finance. We prop…
The paper studies time-optimal problems on specific Lie groups, describing orbits and integrals.
The aim of this paper is to provide new theoretical and computational understanding on two loss regularizations employed in deep learning, known as local entropy and heat regularization. For both regularized losses we introduce variational characterizations that naturally suggest a two-step scheme for their optimizatio…
The paper discusses polynomial convergence to conical Kähler-Einstein metrics.
Transformers can approximate Kalman Filtering in linear systems with small error.
pPCA speeds up PCA by priming initial estimates for faster, more accurate results.
New method for insurance valuation combining hedging and risk minimization.
New methods use vector search and nearest-neighbor matching for policy learning in causal inference.
We introduce a two step algorithm with theoretical guarantees to recover a jointly sparse and low-rank matrix from undersampled measurements of its columns. The algorithm first estimates the row subspace of the matrix using a set of common measurements of the columns. In the second step, the subspace aware recovery of …
In this paper, we revisit the large-scale constrained linear regression problem and propose faster methods based on some recent developments in sketching and optimization. Our algorithms combine (accelerated) mini-batch SGD with a new method called two-step preconditioning to achieve an approximate solution with a time…
Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorith…
Study existence of harmonic 1-forms on Calabi-Yau manifolds.
In this paper we study the geometry of simply connected two-step nilpotent Lie groups of dimension five. We give the Levi-Civita connection, curvature tensor, sectional and scalar curvatures of these spaces and show that they have constant negative scalar curvature. Also we show that the only space which admits left in…
New method uses Riemannian geometry to improve neural network adversarial attacks.