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.
Develops risk measures on Lipschitz spaces for financial positions.
Enhances RJMCMC efficiency with non-linear transport-based proposals.
Proposes a robust IV estimator using optimal transport for corrupted or adversarial data.
Study optimal transport for robust optimization, showing how adversary's strategy relates to regularization.
The paper classifies curves in dual affine and Lorentz-Minkowski planes with constant curvature.
Paper uses optimal transport-based statistics for change point detection.
We consider a generic convex optimization problem associated with regularized empirical risk minimization of linear predictors. The problem structure allows us to reformulate it as a convex-concave saddle point problem. We propose a stochastic primal-dual coordinate (SPDC) method, which alternates between maximizing ov…
We provide a dual representation of quasiconvex maps between two lattices of random variables in terms of conditional expectations. This generalizes the dual representation of quasiconvex real valued functions and the dual representation of conditional convex maps.
The equivalence between multiportfolio time consistency of a dynamic multivariate risk measure and a supermartingale property is proven. Furthermore, the dual variables under which this set-valued supermartingale is a martingale are characterized as the worst-case dual variables in the dual representation of the risk m…
We develop a primal dual active set with continuation algorithm for solving the \ell^0-regularized least-squares problem that frequently arises in compressed sensing. The algorithm couples the the primal dual active set method with a continuation strategy on the regularization parameter. At each inner iteration, it fir…
Dual-sPLS improves feature selection and prediction in high-dimensional data.
Dual Variable Learning Rates improve neural network training efficiency.
In this paper, we consider the problem of recovering a sparse signal based on penalized least squares formulations. We develop a novel algorithm of primal-dual active set type for a class of nonconvex sparsity-promoting penalties, including , bridge, smoothly clipped absolute deviation, capped and mini…
Previous studies on stochastic primal-dual algorithms for solving min-max problems with faster convergence heavily rely on the bilinear structure of the problem, which restricts their applicability to a narrowed range of problems. The main contribution of this paper is the design and analysis of new stochastic primal-d…
Introduces statistical optimal transport for probabilistic lectures.
Algorithm optimizes constrained reinforcement learning with dual variables.
A new method for distributed optimization reduces communication rounds without minibatches.
We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual sparse reconstruction problem. It is efficient when the number of unknown variables is much larger than the number of observations because of the dual formulation. More…
Optimal transport simplifies machine learning by comparing probability measures.
Optimizes wireless network resource management with state-augmented policies.
Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different variables should be stored on both primal and dual domain meshes with a discrete Hodge star used to transfer information between the meshes. We s…
Study proves convergence of subgradients for optimal transport-based objectives.
We present a novel algorithm for non-linear instrumental variable (IV) regression, DualIV, which simplifies traditional two-stage methods via a dual formulation. Inspired by problems in stochastic programming, we show that two-stage procedures for non-linear IV regression can be reformulated as a convex-concave saddle-…
New method tackles confounded bandit problems with dual instrumental variables.
A framework for cost of belief revision in uncertain agents.
Block Coordinate Update (BCU) methods enjoy low per-update computational complexity because every time only one or a few block variables would need to be updated among possibly a large number of blocks. They are also easily parallelized and thus have been particularly popular for solving problems involving large-scale …
A large number of objectives have been proposed to train latent variable generative models. We show that many of them are Lagrangian dual functions of the same primal optimization problem. The primal problem optimizes the mutual information between latent and visible variables, subject to the constraints of accurately …
Generalized Linear Models (GLM) form a wide class of regression and classification models, where prediction is a function of a linear combination of the input variables. For statistical inference in high dimension, sparsity inducing regularizations have proven to be useful while offering statistical guarantees. However…
Paper proposes a new efficient transport-based dissimilarity measure for time series classification.
We show that the span of the variable in the Lawrence-Krammer-Bigelow representation matrix of a braid is equal to the twice of the dual Garside length of the braid, as was conjectured by Krammer. Our proof is close in spirit to Bigelow's geometric approach. The key observation is that the dual Garside length of a …
The paper extends NUP representations to factor graphs for better estimation.
We review a numerical technique, referred to as the Transport-based Mesh-free Method (TMM), and we discuss its applications to mathematical finance. We recently introduced this method from a numerical standpoint and investigated the accuracy of integration formulas based on the Monte-Carlo methodology: quantitative err…
Constrained Markov Decision Process (CMDP) is a natural framework for reinforcement learning tasks with safety constraints, where agents learn a policy that maximizes the long-term reward while satisfying the constraints on the long-term cost. A canonical approach for solving CMDPs is the primal-dual method which updat…
We relate the minimax game of generative adversarial networks (GANs) to finding the saddle points of the Lagrangian function for a convex optimization problem, where the discriminator outputs and the distribution of generator outputs play the roles of primal variables and dual variables, respectively. This formulation …
Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When the entropy regularization is added to the problem, the transportation plan can be…
Unified algorithm for efficient pure exploration using dual variables.
This paper introduces AdaSDCA: an adaptive variant of stochastic dual coordinate ascent (SDCA) for solving the regularized empirical risk minimization problems. Our modification consists in allowing the method adaptively change the probability distribution over the dual variables throughout the iterative process. AdaSD…
We offer a simplified proof for Expected Shortfall's dual representation.
This paper shows that the implicit bias of gradient descent on linearly separable data is exactly characterized by the optimal solution of a dual optimization problem given by a smoothed margin, even for general losses. This is in contrast to prior results, which are often tailored to exponentially-tailed losses. For t…
NeAda solves nonconvex minimax optimization by balancing primal and dual variables adaptively.
Unified framework for ensemble transport-based smoothing of non-Gaussian time series.
PLOT uses optimal transport to find neural site handles for causal abstraction.
A fast method for training linear classifiers maximizes margins.
When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's alge…
A new method improves Bayesian filtering in nonlinear systems.
Unified view connects CoCoA and ADMM for distributed ERM.
Framework for analyzing dynamic topological changes in point clouds using persistent homology and dynamic optimal transport.
Framework explains how dual deep networks learn features from unlabeled data.