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,694 papers · 148 categories

Trend · papers per month

22456789 · May 202619922001200920172026
48 results for exponential tilting

Extends ERM with exponential tilting for improved machine learning performance.

problem Improving machine learning models by adjusting loss weights for fairness and robustness.
method Tilted Empirical Risk Minimization (TERM) using exponential tilting.
result TERM can outperform traditional ERM and deliver competitive performance with state-of-the-art methods.

ETM models improve efficiency in semi-supervised logistic regression.

problem Improving efficiency in logistic regression with limited labeled data.
method Developed exponential tilt mixture (ETM) models for semi-supervised estimation.
result ETM-based estimation demonstrates improved efficiency over supervised logistic regression.

New optimization method improves generalization across various tasks.

problem Improving zeroth-order optimization for better generalization.
method Exponential tilting objective to connect zeroth-order optimization with sharpness-aware minimization.
result Achieves better generalization compared to vanilla zeroth-order baselines.

The paper examines the tilted empirical risk's generalization and robustness under negative tilt.

problem The generalization error of machine learning algorithms under negative tilt.
method Uniform and information-theoretic bounds on the tilted generalization error under negative tilt.
result The tilted empirical risk's generalization error has a convergence rate of \(O(n^{-ε/(1+ε)})\).

Study addresses RTB model performance drops due to distribution shifts.

problem Distribution shifts between training and target environments in RTB markets.
method Applies Exponential Tilt Reweighting Alignment (ExTRA) algorithm to estimate and correct model weights.
result Demonstrates improved RTB model performance using ExTRA algorithm.

Reweighting training data to better represent new tasks.

problem Deploying machine learning models to new tasks is challenging due to training data distribution.
method Formulate an exponential tilt distribution shift model and learn train data importance weights to minimize KL divergence.
result The learned train data weights improve target performance evaluation, fine-tuning, and model selection.

Parameters defined via general estimating equations (GEE) can be estimated by maximizing the empirical likelihood (EL). Newey and Smith [Econometrica 72 (2004) 219--255] have recently shown that this EL estimator exhibits desirable higher-order asymptotic properties, namely, that its O(n1)O(n^{-1}) bias is small and that …

2007-08-14abs ↗pdf ↗

Sharp large deviations and Gibbs conditioning for portfolio credit risk models.

problem Analyzing the risk of default in financial portfolios with dependent factors.
method Sharp large deviation estimates and conditional Bahadur-Rao estimates for threshold models with diverging latent factors.
result Conditioned on a large exceedance event, default indicators become asymptotically i.i.d., and loss-given-default is exponentially tilted.

Unified framework for training diffusion and flow models to sample from target distributions.

problem Training diffusion and flow models to sample from target distributions defined by exponential tilting.
method Unified framework combining stochastic optimal control and non-equilibrium thermodynamics perspectives.
result Unified bias-variance decompositions and theoretical support for adjoint-based methods.

Online TERM improves robustness and fairness in streaming data.

problem Streaming data's lack of worst-case fairness and robustness in ERM.
method Proposes an online TERM formulation to balance average-case accuracy with worst-case fairness and robustness.
result Negative tilting effectively suppresses outlier influence, positive tilting improves recall with minimal precision loss.

Method adapts frozen models for few-shot tasks without training.

problem Deployment constraints limit model updates, necessitating new adaptation methods.
method Exponential tilting of latent distribution for inference.
result Method outperforms parameter-update methods across benchmarks.

Iterative tilting fine-tunes diffusion models for reward-tilted distributions.

problem Fine-tuning diffusion models for reward-tilted distributions.
method Decomposes large reward tilts into smaller, tractable tilts via first-order Taylor expansion, avoiding backpropagation.
result Validated on a two-dimensional Gaussian mixture, achieving exact closed-form solutions.

This paper considers the problem of measuring the credit risk in portfolios of loans, bonds, and other instruments subject to possible default under multi-factor models. Due to the amount of the portfolio, the heterogeneous effect of obligors, and the phenomena that default events are rare and mutually dependent, it is…

2017-11-10abs ↗pdf ↗

The study analyzes how neural reward models learn features for policy optimization in a Gaussian single-index model.

problem Reward modeling in policy optimization and its impact on downstream value.
method Two-stage neural reward model: first learns hidden direction, then fits readout layer.
result For any feature-learning temperature above a dimension-free threshold, a constant fraction of neurons recover the hidden direction.

Paper proposes a method to improve MCMC sampling for energy-based models.

problem MCMC sampling of energy-based models is often not mixing in high-dimensional data.
method Proposes using a flow-based model as a backbone to correct the energy-based model, enabling mixing in latent space.
result MCMC sampling of the corrected EBM in the latent space mixes well and traverses modes in the data space.

The study reveals the efficiency of sampling from tilted distributions.

problem Sampling from a tilted distribution of an unknown underlying distribution.
method Self-normalized importance sampling to characterize accuracy.
result Polynomial vs super-polynomial sample complexity for bounded vs unbounded distributions.

Researchers develop a method to generate diffusion-based samples from a tilted distribution.

problem Generating samples from a distribution that has been tilted by a parameter.
method Developed a plug-in estimator and proved Wasserstein bounds and TV-accuracy under certain conditions.
result The method is minimax-optimal and can be applied in various domains like finance and climate modeling.

Adaptive importance sampling techniques are widely known for the Gaussian setting of Brownian driven diffusions. In this work, we want to extend them to jump processes. Our approach relies on a change of the jump intensity combined with the standard exponential tilting for the Brownian motion. The free parameters of ou…

2013-07-08abs ↗pdf ↗

Optimizes antenna tilt for better QoS in cellular networks.

problem Hard to learn optimal antenna tilt policies in real networks due to risk and simulation gap.
method Uses off-policy Contextual Multi-Armed-Bandit (CMAB) techniques to learn from existing data.
result Trained policies show consistent improvements over existing logging policies.

Mutation graph of support τ-tilting modules over skew-gentle algebras is connected.

problem Understanding the structure of support τ-tilting modules over skew-gentle algebras.
method Introducing mutation of maximal rigid objects and using exchange triangles to define mutations of support τ-tilting modules.
result The mutation graph of support τ-tilting modules over a skew-gentle algebra is connected.

A scalable algorithm for sampling and fine-tuning models using Tilt Matching.

problem Efficient sampling and fine-tuning of generative models.
method Tilt Matching, arising from a dynamical equation, minimizes variance and inherits regularity from stochastic interpolants.
result Empirically verified to be efficient and highly scalable, providing state-of-the-art results.

TILT improves target domain performance by penalizing an auxiliary component on unlabeled target inputs.

problem Improving performance on target domain under covariate shift.
method TILT uses a novel objective function to decompose the source predictor and penalize an auxiliary component on unlabeled target inputs.
result TILT improves target domain performance over source-only training and other baselines.

We construct the term structure of the (forward-looking, US market) equity risk premium from SPX option chains. The method is "model-light". Risk-neutral probability densities are estimated by fitting NN-component Gaussian mixture models to option quotes, where NN is a small integer (here 4 or 5). These densities are…

2019-10-31abs ↗pdf ↗

Paper provides estimates for varifolds with critical mean curvature.

problem Estimating tilt-excess on varifolds with critical mean curvature.
method Generalizing Lipschitz approximation and Sobolev-Poincaré estimates to almost-integral rectifiable varifolds.
result VMO-type estimates for quadratic tilt-excess on varifolds with critical mean curvature.

Unified approach to stability conditions on surfaces with quadratic differentials.

problem Identifying spaces of stability conditions on triangulated categories.
method Perverse schober and their global sections, mixed-angulations, flips, finite-length hearts, tilts.
result Identification of moduli spaces of quadratic differentials with arbitrary singularity types.

This paper concerns integral varifolds of arbitrary dimension in an open subset of Euclidean space with its first variation given by either a Radon measure or a function in some Lebesgue space. Pointwise decay results for the quadratic tilt-excess are established for those varifolds. The results are optimal in terms of…

2009-09-17abs ↗pdf ↗

DTM improves dLLM fine-tuning stability and performance.

problem Intractable sequence-level marginal likelihoods for masked diffusion models.
method Discrete Tilt Matching (DTM) recasts dLLM fine-tuning as state-level matching of local unmasking posteriors under reward tilting.
result DTM yields strong gains on Sudoku and Countdown while remaining competitive on MATH500 and GSM8K.

Proves spacetime positive mass theorem for spin initial data sets with arbitrary ends.

problem Proving the spacetime positive mass theorem for specific spacetime configurations.
method Solving a mixed boundary value problem for the Dirac-Witten operator with a Callias potential.
result Established spacetime positive mass theorem for asymptotically flat spin initial data sets with arbitrary ends.

Improves sample quality of generative models using energy-based methods.

problem Low sample quality in generative models.
method Constructs an energy function on latent space, trains an energy-based model, and generates improved samples.
result Significant improvement in sample quality with minimal computational overhead.

Study tackles non-stationary bandit convex optimization with new algorithms.

problem Minimizing regret in non-stationary environments with various measures of non-stationarity.
method Proposed Tilted Exponentially Weighted Average with Sleeping Experts (TEWA-SE) for strongly convex losses and clipped Exploration by Optimization (cExO) for general convex losses.
result Proved minimax-optimality of TEWA-SE for strongly convex losses and introduced cExO for general convex losses.

We construct tilting modules over Jacobian algebras arising from knots. To a two-bridge knot L[a1,,an]L[a_1,\ldots,a_n], we associate a quiver QQ with potential and its Jacobian algebra AA. We construct a family of canonical indecomposable AA-modules M(i)M(i), each supported on a different specific subquiver Q(i)Q(i) of QQ. E…

2020-01-12abs ↗pdf ↗

Reweighted ALPS improves sampling from multimodal distributions using warm start points.

problem Sampling from multimodal distributions is hard due to exponential mixing times.
method Introduces Reweighted ALPS, a modified Annealed Leap-Point Sampler that uses warm start points.
result First polynomial-time bound for Re-ALPS in a general setting, under a natural assumption.

A new method for estimating probabilities and risks using Markov processes.

problem Computational difficulties in classical importance sampling for latent Markov models.
method Proposes a new importance sampling framework that minimizes estimator variance.
result Shows logarithmic efficiency of the proposed estimator.