Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

53105158210 · Jun 202019922001200920172026
48 results for marginal constraints

A framework estimates categorical distributions under constraints, ensuring generality and uniqueness.

problem Estimating categorical distributions summarizing sample data under marginal constraints.
method Theoretical framework + Iterative Proportional Fitting (IPF) to estimate the distribution.
result A unique categorical distribution of Maximum Entropy under marginal constraints exists and is estimated.

The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classic…

2015-06-12abs ↗pdf ↗

Proves existence of solutions to Einstein constraints with specific boundary conditions and verifies Penrose inequality.

problem Existence of asymptotically hyperbolic solutions to Einstein constraints with marginally outer trapped boundaries.
method Constant mean curvature conformal method.
result Verification of Penrose inequality for certain Schwarzschild-AdS black hole perturbations.

This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex transport constraints in addition to having given initial and terminal marginals. Sev…

2018-04-12abs ↗pdf ↗

Hidden variables are ubiquitous in practical data analysis, and therefore modeling marginal densities and doing inference with the resulting models is an important problem in statistics, machine learning, and causal inference. Recently, a new type of graphical model, called the nested Markov model, was developed which …

2013-09-26abs ↗pdf ↗

Bayesian models use hyperparameters to indirectly assign priors, and this work shows how these priors can be derived from maximum entropy principles.

problem Understanding the assumptions and dependencies in Bayesian hierarchical models.
method Demonstrates how canonical distributions and maximum entropy principles can be used to derive marginal priors in hierarchical models.
result Marginal priors in hierarchical models derived from maximum entropy principles have different constraints compared to the original priors.

A new method for optimal transport using neural ODEs that preserves marginal constraints.

problem Optimal transport between two continuous distributions with specific cost functions.
method Iterative construction of neural ODEs to minimize transport cost while preserving marginal constraints.
result Monotonic interior approach that decreases transport cost efficiently.

Framework learns stochastic dynamics from endpoint and intermediate distributions using soft energy constraints.

problem Learning stochastic dynamics from endpoint and intermediate distributional observations.
method Formulates generation as a McKean-Vlasov control problem with soft energy constraints, solving it through FBSDE.
result Model learns coherent stochastic trajectories matching prescribed marginal laws.

The paper improves robust optimization by introducing margin theory.

problem Improving the reliability of solutions in high-dimensional robust optimization.
method Introducing margin theory to improve sample complexity and reliability of solutions.
result The sample complexity of a class of random programs does not depend on the number of variables.

Inference methods are often formulated as variational approximations: these approximations allow easy evaluation of statistics by marginalization or linear response, but these estimates can be inconsistent. We show that by introducing constraints on covariance, one can ensure consistency of linear response with the var…

2016-11-02abs ↗pdf ↗

The study tests a functional-form restriction on risk exposure dynamics using margin debt data.

problem Understanding risk exposure dynamics under capital constraints and slack.
method Testing a regime-conditional functional-form restriction on aggregate risk-exposure dynamics implied by VaR-constrained intermediary models.
result The contraction and growth of exposures under capital constraints and slack are observed and tested.

This paper works out fair values of stock loan model with automatic termination clause, cap and margin. This stock loan is treated as a generalized perpetual American option with possibly negative interest rate and some constraints. Since it helps a bank to control the risk, the banks charge less service fees compared …

2010-05-09abs ↗pdf ↗

We consider the problem of learning Bayesian network classifiers that maximize the marginover a set of classification variables. We find that this problem is harder for Bayesian networks than for undirected graphical models like maximum margin Markov networks. The main difficulty is that the parameters in a Bayesian ne…

2012-07-04abs ↗pdf ↗

Proposes a method to optimize neural network initialization using marginal likelihood maximization.

problem Optimizing hyperparameters for neural network initialization.
method Leverages the connection between neural networks and Gaussian processes to infer optimal hyperparameters.
result Marginal likelihood maximization provides near-optimal prediction performance on MNIST classification tasks.

Graph Attention Networks (GATs) are the state-of-the-art neural architecture for representation learning with graphs. GATs learn attention functions that assign weights to nodes so that different nodes have different influences in the feature aggregation steps. In practice, however, induced attention functions are pron…

2019-10-25abs ↗pdf ↗

Proposes a novel SVM model for binary classification with different misclassification costs.

problem Real-world classification problems with varying misclassification costs.
method Incorporates performance constraints in SVM formulation to seek a hyperplane with maximal margin and misclassification rates below given thresholds.
result The proposed model gives users control over misclassification rates in one class at the expense of the other.

We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be approximated using linear programming (LP) problems which result from a discretisa…

2017-10-22abs ↗pdf ↗

New insights into deep learning: reducing training data significantly improves performance.

problem Understanding and improving generalization in deep learning models.
method Analyzing the distribution of classification margins and dynamically reducing the training set.
result The area under the curve of the margin distribution is a good measure of generalization.

Improved robustness of machine learning models with controlled Lipschitz constants.

problem Vulnerability of state-of-the-art models to adversarial attacks.
method Proposes a CLL loss that calibrates the margin and Lipschitz constant penalties, improving robustness certificates.
result Consistently outperforms other losses on CIFAR-10, CIFAR-100, and Tiny-ImageNet datasets.

Multiple marginal matching problem aims at learning mappings to match a source domain to multiple target domains and it has attracted great attention in many applications, such as multi-domain image translation. However, addressing this problem has two critical challenges: (i) Measuring the multi-marginal distance amon…

2019-11-03abs ↗pdf ↗

Efficiently computes robust option prices using multi-marginal martingale transport.

problem Computing robust option prices under martingale constraints.
method Extending state space, sequential martingale structure, entropic regularisation.
result Fast computation of optimal solutions for large problems.

New findings on PAC learning and marginal distribution estimation.

problem Understanding how PAC learning relates to marginal distribution estimation under distributional constraints.
method Revisited the connection between PAC learning, uniform convergence, and density estimation, considering a known family of marginal distributions.
result PAC learning is sandwiched between two refined models of density estimation, differing only in whether the learner knows the set of well-estimated events in H.

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …

2008-10-24abs ↗pdf ↗

The dual representation of the martingale optimal transport problem in the Skorokhod space of multi dimensional cadlag processes is proved. The dual is a minimization problem with constraints involving stochastic integrals and is similar to the Kantorovich dual of the standard optimal transport problem. The constraints…

2014-04-05abs ↗pdf ↗

A quantum framework optimizes collateral allocation for derivatives.

problem Legal constraints and operational rules in collateral allocation for derivatives.
method Certified higher-order quantum framework that normalizes margin requirements and builds a bounded neighborhood of actions.
result Quantum framework improves certified sample quality compared to classical methods.

Metaheuristics optimize portfolios with pre-assignment and margin trading for better risk-adjusted returns.

problem Maximizing returns while minimizing risk in portfolio optimization.
method Incorporates pre-assignment constraints and margin trading strategies using Genetic Algorithms and Particle Swarm Optimization.
result Metaheuristic-based portfolio optimization yields superior risk-adjusted returns compared to traditional methods.

Kearns et al. [2018] recently proposed a notion of rich subgroup fairness intended to bridge the gap between statistical and individual notions of fairness. Rich subgroup fairness picks a statistical fairness constraint (say, equalizing false positive rates across protected groups), but then asks that this constraint h…

2018-08-24abs ↗pdf ↗