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

74148221295 · May 202619922001200920172026
48 results for margin control

This work improves motion planning for quadcopters by learning and reasoning about controller performance.

problem Improving motion planning for quadcopters with safety margins and execution reliability.
method Introspective learning and reasoning to correct execution bias and improve collision checking.
result Substantial reduction in safety margins for motion actions, leading to safer execution.

Bayesian inference in the presence of an intractable likelihood function is computationally challenging. When following a Markov chain Monte Carlo (MCMC) approach to approximate the posterior distribution in this context, one typically either uses MCMC schemes which target the joint posterior of the parameters and some…

2016-07-08abs ↗pdf ↗

MEC-Cox: A Machine-Learning-Assisted Generalized Entropy Calibration Method for Estimating ATT Marginal Hazard-Ratio

problem Estimating ATT marginal hazard-ratio in externally controlled survival trials
method Machine-learning-assisted generalized entropy calibration for IPW Cox regression
result Reduces bias, increases efficiency, and improves coverage

A method for logistic regression inference using both internal and external data.

problem Inability to estimate intercept and marginal case proportion in case-control logistic regression.
method Empirical likelihood approach integrating internal and external data.
result Intercept parameter becomes identifiable with external information, and all parameters are estimable consistently.

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 ↗

Paper creates transparent, safe synthetic data from coarsened margins.

problem Creating synthetic data that maintains original relationships and is safe from disclosure.
method Defining and curating margins, applying SDC, coarsening counts, and using IPF algorithm.
result Synthetic data derived from safe, coarsened margins maintains original relationships.

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.

3MSBM learns smooth trajectories from multiple snapshots.

problem Capturing long-range temporal dependencies in complex systems.
method Lifts dynamics to phase space, generalizes stochastic bridges to multi-marginal conditional problems, learns transport maps preserving intermediate marginals.
result Significantly improves convergence and scalability in capturing complex dynamics.

We solve the Plateau problem for marginally outer trapped surfaces in general Cauchy data sets. We employ the Perron method and tools from geometric measure theory to force and control a blow-up of Jang's equation. Substantial new geometric insights regarding the lower order properties of marginally outer trapped surfa…

2007-11-27abs ↗pdf ↗

Gradient-based methods can be biased by distributional asymmetries in bivariate categorical data.

problem Gradient-based causal discovery methods can be biased by distributional asymmetries in bivariate categorical data.
method Identified and examined two distributional biases: Marginal Distribution Asymmetry and Marginal Distribution Shift Asymmetry. Employed two simple models to demonstrate and control these biases.
result Gradient-based methods can be biased by distributional asymmetries, and these biases can be controlled.

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

In this work, we study a new approach to optimizing the margin distribution realized by binary classifiers. The classical approach to this problem is simply maximization of the expected margin, while more recent proposals consider simultaneous variance control and proxy objectives based on robust location estimates, in…

2018-10-11abs ↗pdf ↗

The key to generalization is controlling the complexity of the network. However, there is no obvious control of complexity -- such as an explicit regularization term -- in the training of deep networks for classification. We will show that a classical form of norm control -- but kind of hidden -- is present in deep net…

2019-03-12abs ↗pdf ↗

A new sampler for FLMs improves token-level decoding controls.

problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.

RNE provides a flexible framework for diffusion models, enabling inference-time control and energy-based training.

problem Insufficient knowledge of marginal densities in diffusion models.
method Introduces Radon-Nikodym Estimator (RNE) to reveal the connection between marginal densities and transition kernels.
result RNE delivers strong results in inference-time control and energy-based diffusion training.

New stability bounds for Sinkhorn's algorithm in entropic optimal transport.

problem Stability and convergence of Sinkhorn's algorithm for entropic optimal transport.
method Semiconcavity approach to analyze stability and convergence.
result Exponential convergence of Sinkhorn's algorithm under semiconcavity conditions.

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.

L-ARC improves model fairness by localizing risk guarantees.

problem Improving model fairness in tasks like image segmentation and wireless networks.
method Localized Adaptive Risk Control (L-ARC) updates a threshold function in RKHS to target localized statistical risk guarantees.
result L-ARC produces prediction sets with improved fairness across different data subpopulations.

Consider the problem of a central bank that wants to manage the exchange rate between its domestic currency and a foreign one. The central bank can purchase and sell the foreign currency, and each intervention on the exchange market leads to a proportional cost whose instantaneous marginal value depends on the current …

2017-12-06abs ↗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 ↗

New method uses unlabeled data to estimate intercept in case-control logistic regression.

problem Estimating intercept in case-control logistic regression.
method Construct likelihood function, use iterative algorithm to find maximum likelihood estimator.
result Proposed method identifies intercept and improves estimation efficiency.

The paper tackles robust control with uncertain dependence using data-driven methods.

problem Nonparametric robust control under dependence uncertainty in multi-period stochastic systems.
method Nonparametric adaptive robust control framework using stochastic gradient descent ascent algorithm.
result The controller benefits from knowing more about the uncertain model.

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.

Improved exploration in RL with latent state marginalization.

problem Complexity of deep probabilistic models limits their practical use in reinforcement learning.
method Adopting latent variable policies within the MaxEnt framework, with low-cost marginalization of latent states.
result Effective marginalization leads to better exploration and more robust training.

This document constitutes the final report of the contractual activity between Directa SIM and Dipartimento di Automatica e Informatica, Politecnico di Torino, on the research topic titled "quantificazione del rischio di un portafoglio di strumenti finanziari per trading online su device fissi e mobili."

2016-08-29abs ↗pdf ↗

Study approximates operators on labelled conditional distributions for non-exchangeable systems.

problem Approximating operators on constrained probability measures for non-exchangeable systems.
method Combines cylindrical approximations and DeepONet-type neural architecture for finite-dimensional representations.
result Establishes a universal approximation theorem for continuous operators on Mλ\cal M_λ.

Identifying components and estimating mixing weights in unlabeled finite mixtures under marginal independence.

problem Identifying components and estimating mixing weights in unlabeled finite mixtures.
method Proving structural results and extending them to observable mixtures.
result Identifying components and estimating mixing weights under marginal independence.

Bayesian approach models nonignorable missing data using copulas and marginal quantiles.

problem Nonignorable missing data in lead exposure and test score analysis.
method Gaussian copula model with auxiliary marginal quantiles for missingness indicators and study variables.
result Efficient MCMC algorithm estimates copula correlation and marginal distributions consistently.

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 ↗

Quantization techniques have been applied in many challenging finance applications, including pricing claims with path dependence and early exercise features, stochastic optimal control, filtering problems and efficient calibration of large derivative books. Recursive Marginal Quantization of the Euler scheme has recen…

2017-01-06abs ↗pdf ↗

This paper supplies two possible resolutions of Fortune's (2000) margin-loan pricing puzzle. Fortune (2000) noted that the margin loan interest rates charged by stock brokers are very high in relation to the actual (low) credit risk and the cost of funds. If we live in the Black-Scholes world, the brokers are presumabl…

2019-06-03abs ↗pdf ↗

Optimal control theory connects diffusion models to generative modeling.

problem Sampling from unnormalized densities in statistics and computational sciences.
method Deriving a Hamilton-Jacobi-Bellman equation and applying control theory to minimize Kullback-Leibler divergence.
result Time-reversed diffusion sampler (DIS) outperforms other diffusion-based sampling methods.

DIET tests conditional independence using marginal dependence measures of residual information.

problem Computational intractability of conditional randomization tests (CRTs).
method DIET avoids fitting large models by leveraging marginal independence statistics of information residuals.
result DIET achieves higher power than other tractable CRTs on synthetic and real benchmarks.

The paper develops distribution-free methods for ordinal classification.

problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.