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

Trend · papers per month

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for Conditional approach

Unified approach for nonparametric regression and conditional distribution learning.

problem Nonparametric regression and conditional distribution learning problems.
method Generative learning framework with deep neural networks to estimate a conditional generator.
result The approach estimates a regression function and a conditional generator simultaneously, providing good prediction intervals.

Paper resolves conflicting Shapley value approaches by showing conditional is unsound and marginal is preferred.

problem Conflicting results from conditional and marginal Shapley value approaches when features are correlated.
method Uses causal arguments to show differences arise from assumptions about missing causal information.
result Marginal approach is preferred over conditional due to causal soundness.

This article reviews and compares various methods for estimating conditional distributions.

problem Inference of conditional distributions in statistics.
method Classical nonparametric methods and modern generative models.
result A systematic numerical comparison of methods using performance metrics.

We offer a new, rigorous approach to conditional mean embeddings without operator constraints.

problem Lack of rigorous, operator-free approach to conditional mean embeddings.
method Measure-theoretic approach to conditional mean embeddings.
result Natural regression interpretation and universal consistency of empirical estimates.

Proposes a new method for interpreting feature importance and effects in dependent feature models.

problem Challenges in interpreting feature importance when features are dependent and interactions are present.
method Conditional Subgroup Approach
result Conditional PFI and PDP estimates based on this approach often outperform existing methods.

The paper develops a new approach to conditional risk measures using modular convex analysis.

problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional LL^{\infty}-space.
result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.

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.

Paper introduces a differentiable regularizer for condition number to improve neural network stability.

problem Maintaining numerical stability in neural networks to ensure reliable and performant models.
method Introduces a novel differentiable regularizer for the condition number of weight matrices.
result Derives a differentiable formula for the gradient of the regularizer, promoting matrices with low condition numbers.

CSI method learns conditional distributions by estimating flow equations.

problem Learning conditional distributions in generative models.
method Estimates probability flow equations to transport reference to target distribution.
result Derives explicit expressions for conditional drift and score functions.

Two neural network methods approximate conditional optimal transport for Bayesian inference.

problem Approximating conditional optimal transport for Bayesian inference in high dimensions.
method Neural network approximations of conditional optimal transport maps.
result Improved scalability and modeling choices for conditional sampling and density estimation.

Unified framework for arbitrary conditional inference using AI and Bayesian methods.

problem Limited flexibility in existing conditional inference methods.
method Bayesian generative modeling with stochastic iterative algorithm.
result Single learned model for universal conditional prediction with uncertainty quantification.

Proposes a method to incorporate current market conditions in VaR and stress testing.

problem Inaccurate VaR and stress testing under changing market conditions.
method Clusters market conditions using Variational Inference (VI) and historical data weighting.
result Proposed approach provides more accurate insights into portfolio risk under near-term market changes.

We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approach relies upon creating a sequence of covers on the conditioning variable and maintaining a different model for each set within a cover. Infere…

2010-05-13abs ↗pdf ↗

We consider Blackwell approachability, a very powerful and geometric tool in game theory, used for example to design strategies of the uninformed player in repeated games with incomplete information. We extend this theory to "generalized quitting games" , a class of repeated stochastic games in which each player may ha…

2016-09-28abs ↗pdf ↗

Unified CI test for categorical and ordinal data maintains power in high dimensions.

problem Rapid degradation of statistical power in existing CI tests for high-dimensional conditioning variables.
method Unified CI test for categorical and ordinal data, maintaining reasonable calibration and power in high dimensions.
result Our test outperforms existing baselines in model testing and structure learning for dense directed graphical models.

This paper proposes a new method for conditional sampling using optimal transport.

problem Sampling conditional distributions in Bayesian inference and density estimation.
method Iterative block-triangular transport maps solving an optimal transport problem with a weighted L2 cost function.
result The proposed method extends the data-driven approach for conditional sampling.

A new diffusion model uses efficient conditional estimators for discrete data.

problem Efficient estimation of conditional probabilities for discrete data.
method Discrete denoising diffusion framework with sample-efficient NeurISE conditional estimation.
result The method outperforms existing approaches in various metrics on binary and scientific data.

In approachability with full monitoring there are two types of conditions that are known to be equivalent for convex sets: a primal and a dual condition. The primal one is of the form: a set C is approachable if and only all containing half-spaces are approachable in the one-shot game; while the dual one is of the form…

2013-05-23abs ↗pdf ↗

Efficiently computes optimal transport maps and Wasserstein barycenters using conditional normalizing flows.

problem Computing optimal transport maps and Wasserstein barycenters in high-dimensional spaces.
method Uses conditional normalizing flows to approximate distributions and solve the primal problem.
result Shows computational feasibility for hundreds of input distributions and yields accurate results.

This paper proposes a new method to connect language and physical actions in reinforcement learning.

problem Connecting linguistic representations to the physical world in embodied agents.
method Language-conditioned goal generators to decouple sensorimotor learning from language acquisition.
result Agents can demonstrate a diversity of behaviors for any given instruction.

Bayesian model estimates treatment effects near cutoffs in regression discontinuity designs.

problem Estimating conditional average treatment effects in regression discontinuity designs.
method Develops a Bayesian additive regression tree (BART) model with linear leaf-level regressions.
result Adapts to different slopes on the running variable near the cutoff, providing interpretable inference.

Many machine learning tasks, such as learning with invariance and policy evaluation in reinforcement learning, can be characterized as problems of learning from conditional distributions. In such problems, each sample xx itself is associated with a conditional distribution p(zx)p(z|x) represented by samples $\{z_i\}_{i=1…

2016-07-15abs ↗pdf ↗

This work improves imitation learning and goal-conditioned RL by estimating value densities.

problem Effective solutions for imitation and goal-conditioned reinforcement learning require reliably reaching specified states or demonstrations.
method The approach uses recent advances in density estimation to learn value functions efficiently and without hindsight bias.
result The method achieves state-of-the-art demonstration sample-efficiency in imitation learning and is both efficient and bias-free in goal-conditioned reinforcement learning.

New methods target conditional demographic parity using optimal transport distances.

problem Auditing and enforcing conditional demographic parity (CDP) in models with complex conditioning variables.
method Developed novel measures of conditional demographic disparity (CDD) based on optimal transport distances and regularization-based approaches.
result Validated methods airbit{} and airlp{} effectively target CDP in real-world datasets with continuous model outputs.

Proposes a new GAN architecture for generating data conditioned on partial information.

problem Generating data conditioned on partial ancillary information.
method Introduces a new Adversarial Network architecture and training strategy.
result The proposed method outperforms standard Conditional GANs in generating data under partial conditioning.

Value-at-Risk and its conditional allegory, which takes into account the available information about the economic environment, form the centrepiece of the Basel framework for the evaluation of market risk in the banking sector. In this paper, a new nonparametric framework for estimating this conditional Value-at-Risk i…

2017-12-15abs ↗pdf ↗

This paper simplifies conditional Sobol' indices calculation using PCE bases.

problem Computational inefficiency and lack of consistency in evaluating conditional Sobol' indices.
method Analytical extraction of conditional Sobol' indices via basis decomposition of PCE expansions.
result Derives closed-form expressions for conditional Sobol' indices.

New approach uses deep generative models for inventory and pricing decisions.

problem Data-driven inventory and pricing decisions in feature-based newsvendor problems.
method Conditional deep generative models (cDGMs) to learn demand distribution and generate probabilistic forecasts.
result Effective in optimizing inventory and pricing decisions, with theoretical guarantees and real-world applications.

Meta-learner estimates heterogeneous DiD effects robustly.

problem Estimating heterogeneous treatment effects in panel data with DiD.
method Doubly robust meta-learner for CATT, using convex risk minimization and auxiliary models.
result Superior performance over existing methods in empirical tests.

Paper proposes a pre-conditioning method to speed up gradient descent in multi-agent optimization.

problem Speed up convergence of gradient descent in multi-agent optimization problems.
method Iterative pre-conditioning approach to mitigate the effect of problem conditioning.
result Significant improvement in convergence speed of gradient descent method.

Generative model learns conditional distributions on collective variable levels.

problem Modeling conditional probability distributions on collective variable levels.
method General and efficient learning approach, data enrichment strategy.
result Effective generative models on different level-sets of collective variables.

Estimates conditional Brenier maps using entropic optimal transport.

problem Non-parametric estimation of conditional Brenier maps.
method Entropic optimal transport for scalable non-parametric estimation.
result Entropic optimal transport maps asymptotically converge to conditional Brenier maps.

Multivariate binary distributions can be decomposed into products of univariate conditional distributions. Recently popular approaches have modeled these conditionals through neural networks with sophisticated weight-sharing structures. It is shown that state-of-the-art performance on several standard benchmark dataset…

2017-03-22abs ↗pdf ↗