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

115231346461 · Jun 202019922001200920172026
48 results for margin requirements

Study examines liquidation, leverage, and optimal margin requirements in Bitcoin futures markets.

problem Understanding and optimizing margin requirements in Bitcoin futures markets.
method Empirical analysis using generalized extreme value theory and BitMEX data.
result Margin requirements need to be significantly higher to reduce daily margin calls.

Adversarial training is a technique for training robust machine learning models. To encourage robustness, it iteratively computes adversarial examples for the model, and then re-trains on these examples via some update rule. This work analyzes the performance of adversarial training on linearly separable data, and prov…

2019-05-22abs ↗pdf ↗

Initial margin requirements are becoming an increasingly common feature of derivative markets. However, while the valuation of derivatives under collateralisation (Piterbarg 2010, Piterbarg2012), under counterparty risk with unsecured funding costs (FVA) (Burgard2011, Burgard2011, Burgard2013) and in the presence of re…

2014-05-02abs ↗pdf ↗

CMRM improves robustness in noisy label settings without requiring privileged knowledge.

problem Learning with noisy labels without privileged knowledge.
method Conformal Margin Risk Minimization (CMRM) framework.
result CMRM consistently improves accuracy and reduces mislabeling under various noise conditions.

New MKABSDEs help calculate initial margins in financial contracts.

problem Calculating initial margins in financial contracts with dependencies.
method Introduced MKABSDEs, provided existence and uniqueness, applied to CVaR, used deterministic and Monte-Carlo methods for numerical approximations.
result MKABSDEs provide a new way to solve for initial margins in financial contracts.

Deep neural network (DNN) regression models are widely used in applications requiring state-of-the-art predictive accuracy. However, until recently there has been little work on accurate uncertainty quantification for predictions from such models. We add to this literature by outlining an approach to constructing predi…

2019-08-26abs ↗pdf ↗

We propose a model for the credit and liquidity risks faced by clearing members of Central Counterparty Clearing houses (CCPs). This model aims to capture the features of: gap risk; feedback between clearing member default, market volatility and margining requirements; the different risks faced by various types of mark…

2016-04-01abs ↗pdf ↗

Improves sampling from complex hierarchical models using HMC and automatic marginalization.

problem Sampling from complex hierarchical models is difficult for HMC.
method Proposes automatic marginalization as part of the sampling process using HMC in a graphical model extracted from a PPL.
result Significantly improves sampling from real-world hierarchical models.

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.

A mesh-free method solves continuum-marginal optimal transport problems.

problem Recovering minimum-energy velocity fields from time-continuous probability marginals.
method Embeds weak continuity equation in a reproducing kernel Hilbert space, optimizing with mini-batch stochastic methods.
result Accurately recovers drift and maintains marginal consistency in synthetic experiments.

A new approach for instance-optimal learning that bypasses impossibility results.

problem Impossibility of achieving marginal-by-marginal guarantees for all marginals.
method Introduces relatively smart learning, which requires competition only with certifiable semi-supervised guarantees.
result One-Inclusion Graph learner is relatively smart up to squaring the sample complexity.

Both in practice and in the academic literature, models for setting margin requirements in futures markets classically use daily closing price changes. However, as well documented by research on high-frequency data, financial markets have recently shown high intraday volatility, which could bring more risk than expecte…

2011-03-28abs ↗pdf ↗

The paper tackles fVaR prediction methods in finance.

problem Predicting future values at risk (fVaR) in finance.
method Various methods including Nested MC-empirical quantile, percentiles from distributions, quantile regressions, and limited inner simulations.
result Improved methods for predicting fVaRs, including those that are computationally efficient.

In critical decision-making scenarios, optimizing accuracy can lead to a biased classifier, hence past work recommends enforcing group-based fairness metrics in addition to maximizing accuracy. However, doing so exposes the classifier to another kind of bias called infra-marginality. This refers to individual-level bia…

2019-09-03abs ↗pdf ↗

This paper identifies and bounds ICE central moments using PO marginal central moments.

problem Identifying and characterizing treatment effect heterogeneity.
method Using only marginal central moments of potential outcomes, the paper identifies and bounds central moments of individual causal effects.
result Identification and bounding of central moments of ICE using marginal moments of POs.

Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal probabilities required in inference and learning. However these variational est…

2012-07-11abs ↗pdf ↗

Recurring international financial crises have adverse socioeconomic effects and demand novel regulatory instruments or strategies for risk management and market stabilization. However, the complex web of market interactions often impedes rational decisions that would absolutely minimize the risk. Here we show that, for…

2009-08-05abs ↗pdf ↗

New probabilistic complexity measures for linear and kernel methods.

problem Limitations of linear and kernel methods in machine learning.
method Introducing approximate notions of dimensional and margin complexity.
result Approximate complexity measures are both sufficient and necessary for learning.

We develop an HMC algorithm to easily marginalize random effects in LMMs.

problem Bayesian inference in LMMs is challenging, especially marginalizing random effects.
method Developed an HMC algorithm to marginalize random effects in LMMs efficiently.
result Marginalization is always beneficial when applicable and improves various models, especially cognitive science models.

The paper distinguishes between conditional and marginal processes in language models and discusses conditions for usefulness.

problem The conditional nature of language models trained on observed sequences and the need for marginal text-only processes.
method Distinguishing between full conditional language process, marginal text-only process, and model-induced distribution; analyzing assumptions of stationarity and ergodicity.
result The marginal text-only law is useful only when the observed prefix is an approximately sufficient statistic for the latent circumstances relevant to continuation.

New method for efficient marginalization of discrete latent variables in neural networks.

problem Computational challenges in training models with discrete latent variables.
method Parameterizing discrete distributions using sparse mappings (sparsemax and structured variants) to reduce support and enable efficient marginalization.
result Achieved good performance in various tasks with efficient and practical training.

Data augmentation (DA) is commonly used during model training, as it significantly improves test error and model robustness. DA artificially expands the training set by applying random noise, rotations, crops, or even adversarial perturbations to the input data. Although DA is widely used, its capacity to provably impr…

2019-05-08abs ↗pdf ↗

New method optimizes hyperparameters in deep learning models efficiently.

problem Manual hyperparameter tuning in deep learning models is inefficient and requires expertise.
method Introduces lower bounds to the linearized Laplace approximation of the marginal likelihood using neural tangent kernels.
result Optimization of hyperparameters can be significantly accelerated using the method.

A classical condition for fast learning rates is the margin condition, first introduced by Mammen and Tsybakov. We tackle in this paper the problem of adaptivity to this condition in the context of model selection, in a general learning framework. Actually, we consider a weaker version of this condition that allows one…

2008-04-18abs ↗pdf ↗

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 ↗

Deep networks converge in direction, with implications for predictions and margins.

problem Understanding convergence and alignment in deep learning networks.
method Developed a theory of unbounded nonsmooth Kurdyka-Łojasiewicz inequalities for functions definable in an o-minimal structure.
result Network weights, predictions, training errors, and margin distribution converge in direction and align with gradient flow.

We develop a framework for post model selection inference, via marginal screening, in linear regression. At the core of this framework is a result that characterizes the exact distribution of linear functions of the response yy, conditional on the model being selected (``condition on selection" framework). This allows…

2014-02-23abs ↗pdf ↗

Paper improves DP-ERM for binary linear classification with large-margin subsets.

problem Differentially private binary linear classification with large-margin subsets.
method Efficient (ε,δ)(\varepsilon,δ)-DP algorithm with empirical zero-one risk bound.
result Improved empirical zero-one risk bound for binary linear classification.

Proposes a method to construct risk-neutral marginals from arbitrage-free option prices.

problem Lack of risk-neutral marginals that are free of arbitrage and easy to use.
method Explicit construction of risk-neutral marginals from discrete arbitrage-free option prices.
result Explicit construction guarantees risk-neutral marginals free of butterfly and calendar arbitrage.

Computing the marginal likelihood (ML) of a model requires marginalizing out all of the parameters and latent variables, a difficult high-dimensional summation or integration problem. To make matters worse, it is often hard to measure the accuracy of one's ML estimates. We present bidirectional Monte Carlo, a technique…

2015-11-08abs ↗pdf ↗

A deep BSDE approach tackles multi-layered xVA calculations for portfolio valuation.

problem Computational intractability in nested simulations for multi-layered xVA calculations.
method Iterative deep BSDE approach, change-of-measure method, quantile regression for margin computation.
result Reduces computational demands and successfully scales to high-dimensional portfolios.

We present an approach to market-consistent multi-period valuation of insurance liability cash flows based on a two-stage valuation procedure. First, a portfolio of traded financial instrument aimed at replicating the liability cash flow is fixed. Then the residual cash flow is managed by repeated one-period replicatio…

2016-07-14abs ↗pdf ↗

The paper emphasizes the importance of joint predictions over marginal predictions for decision-making.

problem The need for accurate joint predictions in decision-making problems.
method The paper analyzes combinatorial decision problems, sequential predictions, and multi-armed bandits, introducing an approximate Thompson sampling algorithm and new regret bounds.
result Accurate joint predictions are essential for good performance in decision-making problems.

We give conditions on a general stress-energy tensor T_{αβ} in a spherically symmetric black hole spacetime which are sufficient to guarantee that the black hole will contain a (spherically symmetric) marginally trapped tube which is eventually achronal, connected, and asymptotic to the event horizon. Price law decay p…

2007-02-19abs ↗pdf ↗

Learning knowledge representation is an increasingly important technology that supports a variety of machine learning related applications. However, the choice of hyperparameters is seldom justified and usually relies on exhaustive search. Understanding the effect of hyperparameter combinations on embedding quality is …

2019-12-21abs ↗pdf ↗