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.
New scalable methods for unbalanced optimal transport improve efficiency and applicability.
C-VAE improves VAE by resolving prior issues and generating better samples.
New algorithm estimates transport maps with nearly optimal error.
Variational problems that involve Wasserstein distances and more generally optimal transport (OT) theory are playing an increasingly important role in data sciences. Such problems can be used to form an examplar measure out of various probability measures, as in the Wasserstein barycenter problem, or to carry out param…
New approach to sparse optimal transport for matching tokens with experts.
Novel algorithms for entropic optimal transport from an optimisation perspective.
GOTEX synthesizes textures by optimizing feature distributions using optimal transport.
New estimators for intrinsic dimension and Wasserstein distance improve OT accuracy.
Novel stability bounds for OT maps improve density estimation.
New algorithm improves OT map estimation for semi-discrete settings.
Optimal data-driven formulations are found for learning and decision-making with historical data.
A new DR formulation improves metric learning for faster and more stable performance.
New formulations for Ricci flows without smoothness.
Paper proposes a QUBO formulation that reduces binary variables in Bayesian network learning.
Defines a metric and form for a bundle moduli space, leading to a zero-curvature formulation.
We study ranking quantilized mean-field games to select top-performing agents.
New conic quadratic formulations improve outlier detection in regression models.
The paper develops mixed-integer formulations for neural networks using partitioning.
Equivalent formulations for low-rank matrix optimization are proven.
A new Lagrangian formulation of the Raychaudhuri equation in non-Riemannian geometry.
In this paper we introduce a new optimization formulation for sparse regression and compressed sensing, called CLOT (Combined L-One and Two), wherein the regularizer is a convex combination of the - and -norms. This formulation differs from the Elastic Net (EN) formulation, in which the regularizer is a…
We propose a parallelizable sparse inverse formulation Gaussian process (SpInGP) for temporal models. It uses a sparse precision GP formulation and sparse matrix routines to speed up the computations. Due to the state-space formulation used in the algorithm, the time complexity of the basic SpInGP is linear, and becaus…
Paper offers a dual formulation for consumption problem with multiplicative habit.
The paper tackles robust statistical methods using Wasserstein DRO formulations.
Genetic algorithms are a well-known method for tackling the problem of variable selection. As they are non-parametric and can use a large variety of fitness functions, they are well-suited as a variable selection wrapper that can be applied to many different models. In almost all cases, the chromosome formulation used …
Dirac structures are geometric objects that generalize both Poisson structures and presymplectic structures on manifolds. They naturally appear in the formulation of constrained mechanical systems. In this paper, we show that the evolution equa- tions for nonequilibrium thermodynamics admit an intrinsic formulation in …
The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not p…
Bayesian optimization identifies optimal alloy formulations.
New formulations capture aversion to ambiguity about volatility.
ROCK method generalizes MOCK for learning dynamical systems efficiently.
In this technical paper, we present a new formulation of higher parallel transport in strict higher gauge theory required for the rigorous construction of Wilson lines and surfaces. Our approach is based on an original notion of Lie crossed module cocycle and cocycle 1- and 2-gauge transformation with a non standard do…
Learning directed acyclic graphs (DAGs) from data is a challenging task both in theory and in practice, because the number of possible DAGs scales superexponentially with the number of nodes. In this paper, we study the problem of learning an optimal DAG from continuous observational data. We cast this problem in the f…
We introduce a new convex formulation for stable principal component pursuit (SPCP) to decompose noisy signals into low-rank and sparse representations. For numerical solutions of our SPCP formulation, we first develop a convex variational framework and then accelerate it with quasi-Newton methods. We show, via synthet…
Current pharmaceutical formulation development still strongly relies on the traditional trial-and-error approach by individual experiences of pharmaceutical scientists, which is laborious, time-consuming and costly. Recently, deep learning has been widely applied in many challenging domains because of its important cap…
Oral Disintegrating Tablets (ODTs) is a novel dosage form that can be dissolved on the tongue within 3min or less especially for geriatric and pediatric patients. Current ODT formulation studies usually rely on the personal experience of pharmaceutical experts and trial-and-error in the laboratory, which is inefficient…
The paper proves an index theorem for loop spaces of compact manifolds.
A geometric multisymplectic formulation of the classical BRST symmetry of constrained first-order classical field theories is described. To effect this we introduce graded analogues of the bundles and manifolds of the multisymplectic formulation of first-order field theories. The Lagrange-d'Alembert formalism is also d…
Since its inception, the modus operandi of multi-task learning (MTL) has been to minimize the task-wise mean of the empirical risks. We introduce a generalized loss-compositional paradigm for MTL that includes a spectrum of formulations as a subfamily. One endpoint of this spectrum is minimax MTL: a new MTL formulation…
Designs a robust data-driven decision-making model to handle multiple overfitting sources.
The reduction of nonholonomic systems is formulated in terms of Dirac reduction. An optimal reduction method for a class of nonholonomic systems is formulated. Several examples are studied in detail.
Unified formulation bridges adversarial and nonstationary bandits.
In this paper, we have proposed a deep quantum SVM formulation, and further demonstrated a quantum-clustering framework based on the quantum deep SVM formulation, deep convolutional neural networks, and quantum K-Means clustering. We have investigated the run time computational complexity of the proposed quantum deep c…
Revisits superfields and geometry, offering new formulations and interpretations.
Joint sparsity regularization in multi-task learning has attracted much attention in recent years. The traditional convex formulation employs the group Lasso relaxation to achieve joint sparsity across tasks. Although this approach leads to a simple convex formulation, it suffers from several issues due to the loosenes…
This paper deals with the explicit design of strategy formulations to make the best strategic choices from a conventional matrix form of representing strategic choices. The explicit strategy formulation is an analytical model which is targeted to provide a mathematical strategy framework to find the best moment for str…
Abstract: Geometrically reformulates estimation theory for finite-dimensional C*-algebras.
Derives a primal-dual MLSVD formulation for multilinear data.
Paper presents a new port-Hamiltonian model for vehicle manipulators.