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

78155233310 · Jun 202019922001200920172026
48 results for margin calls

Proposes a model for clearing prices in financial markets due to margin calls.

problem Determining prices in financial markets following margin calls and short squeezes.
method Developed an explicit formulation for clearing prices after margin calls and short squeezes.
result Identified a threshold short interest ratio leading to discontinuity in clearing prices.

This paper studies binary classification problem associated with a family of loss functions called large-margin unified machines (LUM), which offers a natural bridge between distribution-based likelihood approaches and margin-based approaches. It also can overcome the so-called data piling issue of support vector machi…

2019-08-13abs ↗pdf ↗

In this paper, which is the third installment of the author's trilogy on margin loan pricing, we analyze 1,3671,367 monthly observations of the U.S. broker call money rate, which is the interest rate at which stock brokers can borrow to fund their margin loans to retail clients. We describe the basic features and mean-rev…

2019-06-03abs ↗pdf ↗

The study examines how including additional call option prices affects model-independent price bounds for exotic derivatives.

problem Improving model-independent price bounds for exotic derivatives using additional call option prices.
method Characterization of market settings that guarantee improved price bounds and exclusion of any improvement.
result The inclusion of additional call option prices can significantly impact model-independent price bounds.

We present a new active sampling method we call min-margin which trains multiple learners on bootstrap samples and then chooses the examples to label based on the candidates' minimum margin amongst the bootstrapped models. This extends standard margin sampling in a way that increases its diversity in a supervised manne…

2019-05-31abs ↗pdf ↗

We introduce a useful tool for analyzing boosting algorithms called the ``smooth margin function,'' a differentiable approximation of the usual margin for boosting algorithms. We present two boosting algorithms based on this smooth margin, ``coordinate ascent boosting'' and ``approximate coordinate ascent boosting,'' w…

2008-03-28abs ↗pdf ↗

The paper introduces canonical parameters for marginally trapped surfaces in Minkowski space.

problem Determining marginally trapped surfaces in Minkowski space.
method Introducing canonical parameters and proving existence and uniqueness theorems.
result Every marginally trapped surface is determined by three smooth functions.

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.

Estimates marginal independence structure of Bayesian networks from data.

problem Learning the marginal independence structure of Bayesian networks from observational data.
method Using Gröbner basis and MCMC method (GrUES) to connect and recover the true structure.
result GrUES recovers the true marginal independence structure at a higher rate than simple independence tests.

There are two major paradigms of white-box adversarial attacks that attempt to impose input perturbations. The first paradigm, called the fix-perturbation attack, crafts adversarial samples within a given perturbation level. The second paradigm, called the zero-confidence attack, finds the smallest perturbation needed …

2019-10-01abs ↗pdf ↗

MACQ method explains deep learning models by analyzing feature contributions across prediction levels.

problem Explaining deep learning model predictions.
method Global gradient-based, model-agnostic approach focusing on marginal attribution.
result MACQ separates feature contributions from interaction effects and visualizes 3-way relationships.

We introduce a globally-convergent algorithm for optimizing the tree-reweighted (TRW) variational objective over the marginal polytope. The algorithm is based on the conditional gradient method (Frank-Wolfe) and moves pseudomarginals within the marginal polytope through repeated maximum a posteriori (MAP) calls. This m…

2015-11-06abs ↗pdf ↗

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 ↗

Max-min margin Markov networks improve consistency in structured prediction.

problem Statistical inconsistency in max-margin methods for structured prediction.
method Defining a max-min margin formulation to overcome statistical inconsistency.
result Proves consistency and provides an explicit algorithm with finite sample generalization bounds.

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 ↗

Estimates high-dimensional posterior densities by marginal distributions and neural networks.

problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.

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 ↗

MCD reformulates conditional density estimation into binary classification.

problem Conditional density estimation in statistical and machine learning.
method Marginal Contrastive Discrimination, reformulating into marginal and ratio density functions for binary classification.
result Significantly outperforms existing methods on most density models and regression datasets.

The paper examines how heavy-tailed risks behave under Gaussian copula models.

problem Understanding tail risk probabilities with heavy-tailed marginal risks and Gaussian dependence.
method Modeling heavy-tailed risks using regular variation and analyzing tail probabilities under Gaussian copula.
result The rate of decay of tail set probabilities varies with the type of tail sets and Gaussian correlation matrix.

Adversarial robustness has become an important research topic given empirical demonstrations on the lack of robustness of deep neural networks. Unfortunately, recent theoretical results suggest that adversarial training induces a strict tradeoff between classification accuracy and adversarial robustness. In this paper,…

2018-10-09abs ↗pdf ↗

We obtain bounds on the distribution of the maximum of a martingale with fixed marginals at finitely many intermediate times. The bounds are sharp and attained by a solution to nn-marginal Skorokhod embedding problem in Obłój and Spoida [An iterated Azéma-Yor type embedding for finitely many marginals (2013) Preprint]…

2012-03-30abs ↗pdf ↗

We derive and analyze a new, efficient, pool-based active learning algorithm for halfspaces, called ALuMA. Most previous algorithms show exponential improvement in the label complexity assuming that the distribution over the instance space is close to uniform. This assumption rarely holds in practical applications. Ins…

2011-12-07abs ↗pdf ↗

The support vector machine (SVM) is an important class of learning machines for function approach, pattern recognition, and time-serious prediction, etc. It maps samples into the feature space by so-called support vectors of selected samples, and then feature vectors are separated by maximum margin hyperplane. The pres…

2016-02-12abs ↗pdf ↗

Sequential Monte Carlo techniques are useful for state estimation in non-linear, non-Gaussian dynamic models. These methods allow us to approximate the joint posterior distribution using sequential importance sampling. In this framework, the dimension of the target distribution grows with each time step, thus it is nec…

2012-07-04abs ↗pdf ↗

Speaker Recognition is a challenging task with essential applications such as authentication, automation, and security. The SincNet is a new deep learning based model which has produced promising results to tackle the mentioned task. To train deep learning systems, the loss function is essential to the network performa…

2019-01-28abs ↗pdf ↗

The paper proposes a parallelizable clustering method for multivariate data.

problem The standard model-based clustering method assumes the same number of clusters per margin, which is often unrealistic.
method Developed a finite mixture model per margin with different numbers of clusters, and used a game-inspired algorithm to cluster multivariate data.
result The proposed method shows good performance in various scenarios and real datasets.

Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.

problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.

Any regular Gaussian probability distribution that can be represented by an AMP chain graph (CG) can be expressed as a system of linear equations with correlated errors whose structure depends on the CG. However, the CG represents the errors implicitly, as no nodes in the CG correspond to the errors. We propose in this…

2013-06-28abs ↗pdf ↗

The paper discusses the impact of prior densities on Bayesian model selection.

problem The sensitivity of marginal likelihood to prior choice in Bayesian model selection.
method Analyzes the role of prior densities in model selection, discusses improper priors, and proposes solutions.
result Marginal likelihood can be sensitive to prior choice, but improper priors can still be used with caution.

I unravel the basic long run dynamics of the broker call money market, which is the pile of cash that funds margin loans to retail clients (read: continuous time Kelly gamblers). Call money is assumed to supply itself perfectly inelastically, and to continuously reinvest all principal and interest. I show that the rela…

2019-06-24abs ↗pdf ↗

We present two methods, based on Chebyshev tensors, to compute dynamic sensitivities of financial instruments within a Monte Carlo simulation. These methods are implemented and run in a Monte Carlo engine to compute Dynamic Initial Margin as defined by ISDA (SIMM). We show that the levels of accuracy, speed and impleme…

2018-08-24abs ↗pdf ↗

We introduce a natural generalization of marginally outer trapped surfaces, called immersed marginally outer trapped surfaces, and prove that three dimensional asymptotically flat initial data sets either contain such surfaces or are diffeomorphic to R^3. We establish a generalization of the Penrose singularity theorem…

2012-04-01abs ↗pdf ↗

Proposes logistic-beta process for modeling dependent probabilities with beta marginals.

problem Limited work on flexible and computationally convenient stochastic process extensions for dependent random probabilities.
method Introduces logistic-beta process with logistic transformation and beta marginals, capable of modeling dependence in discrete and continuous domains.
result Logistic-beta processes enable effective posterior inference and design of computationally tractable dependent Bayesian nonparametric models.