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

Trend · papers per month

3977941,1901,587 · Jun 202019922001200920172026
48 results for joint model class

Estimates joint causal effects using single-variable interventions on nonlinear models.

problem Estimating joint causal effects from single-variable interventions.
method Identifiability result and practical estimator for decomposing causal effects.
result Joint effects can be inferred without joint interventional data for nonlinear additive models.

Probabilistic linear discriminant analysis (PLDA) is a method used for biometric problems like speaker or face recognition that models the variability of the samples using two latent variables, one that depends on the class of the sample and another one that is assumed independent across samples and models the within-c…

2018-03-28abs ↗pdf ↗

NullSpaceNet maps inputs to a joint-nullspace for clearer class separability.

problem Class separability and interpretability in image classification.
method NullSpaceNet maps inputs to a joint-nullspace, collapsing same-class inputs and separating different classes.
result NullSpaceNet achieves superior performance with reduced parameters and time.

Study approximates top Lyapunov exponents for surface mapping classes.

problem Approximating topological Lyapunov exponents for surface mapping classes.
method Periodic approximation and joint spectral radius extension.
result Top Lyapunov exponents can be approximated by periodic orbits.

Proposes method for eliciting non-parametric joint priors using normalizing flows.

problem Learning complex non-parametric joint priors for model parameters.
method Expert elicitation combined with normalizing flows for generative modeling.
result Framework supports elicitation of both parametric and non-parametric priors.

Transferring learned models to novel tasks is a challenging problem, particularly if only very few labeled examples are available. Although this few-shot learning setup has received a lot of attention recently, most proposed methods focus on discriminating novel classes only. Instead, we consider the extended setup of …

2019-07-22abs ↗pdf ↗

Many natural signals exhibit a sparse representation, whenever a suitable describing model is given. Here, a linear generative model is considered, where many sparsity-based signal processing techniques rely on such a simplified model. As this model is often unknown for many classes of the signals, we need to select su…

2012-12-12abs ↗pdf ↗

Joint Models for longitudinal and time-to-event data have gained a lot of attention in the last few years as they are a helpful technique to approach common a data structure in clinical studies where longitudinal outcomes are recorded alongside event times. Those two processes are often linked and the two outcomes shou…

2016-09-09abs ↗pdf ↗

The paper evaluates joint life insurance risk under dependence uncertainty using copulas and convex risk measures.

problem Evaluating risk of joint life insurance products under uncertainty in dependence structure.
method Monotonicity of risk evaluation with concordance order, linear programming for bounds, and numerical analysis.
result Bounds for mean, Value-at-Risk, and Expected Shortfall computed using linear programs.

New model learns from missing modalities and class labels.

problem Conflict between learning joint representations and modalities in multi-modal data.
method Introduces a novel conditional multi-modal discriminative model using an informative prior distribution and a likelihood-free objective function.
result Our model achieves state-of-the-art results in downstream classification, acoustic inversion, and image and annotation generation.

The paper explores the relationship between joint mixability and negative dependence structures.

problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.

Develops noncommutative Cowen-Douglas theory for noncommuting operators.

problem Exploring noncommutative analogues of classical Cowen-Douglas theory.
method Defining noncommutative Cowen-Douglas class using matricial joint eigenvalues and showing equivalence classes are determined by associated noncommutative vector bundles.
result Unitary equivalence class of a tuple in the noncommutative Cowen-Douglas class is determined by the equivalence class of its associated noncommutative vector bundle.

COBRA reduces modality gap in cross-modal tasks.

problem Joint embedding spaces fail to sufficiently reduce modality gap in multi-modal tasks.
method COBRA trains image and text modalities in a joint fashion using Contrastive Predictive Coding and Noise Contrastive Estimation.
result COBRA significantly reduces the modality gap and generates robust joint-embedding space.

Paper proposes a new method to evaluate joint risk under uncertainty.

problem Evaluating joint risk of multiple insurance risks under dependence uncertainty.
method Axiomatic approach to scalar and vector-valued distortion joint risk measures.
result Established a new scalar distortion joint risk measure with positive homogeneity.

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.

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.

Introduces joint exclusivity (JE), a new form of negative dependence.

problem Negative dependence structures in probability distributions.
method Defines JE by exclusion of the interior of the non-negative orthant, establishes necessary and sufficient conditions for existence, proposes a canonical construction.
result Sharp necessary and sufficient condition for existence of JE random vectors with prescribed marginals.

We propose a method for unsupervised domain adaptation that trains a shared embedding to align the joint distributions of inputs (domain) and outputs (classes), making any classifier agnostic to the domain. Joint alignment ensures that not only the marginal distributions of the domain are aligned, but the labels as wel…

2019-05-26abs ↗pdf ↗

LSDM uses unpaired data to match latent space distributions for generative modeling.

problem Generating high-quality images with limited paired data.
method Two-stage approach: latent space learning from paired and unpaired data, followed by joint distribution matching.
result LSDM enhances geometric fidelity in generated outputs and provides theoretical insights into LDMs.

A new model fits SPX and VIX volatility surfaces and term structures efficiently.

problem Calibrating SPX and VIX volatility models to market data.
method Gaussian polynomial volatility models, joint calibration, functional quantization, Neural Networks.
result A conventional one-factor Markovian model outperforms rough and non-rough models.

LADD models improve discrete diffusion for faster language generation.

problem Practical discrete diffusion models ignore cross-token dependencies, degrading performance.
method Introduces a learnable auxiliary latent channel, diffusing over the joint (token, latent) space.
result LADD models yield improvements on unconditional generation metrics.

This paper discusses online algorithms for inverse dynamics modelling in robotics. Several model classes including rigid body dynamics (RBD) models, data-driven models and semiparametric models (which are a combination of the previous two classes) are placed in a common framework. While model classes used in the litera…

2018-09-13abs ↗pdf ↗

Directed latent variable models that formulate the joint distribution as p(x,z)=p(z)p(xz)p(x,z) = p(z) p(x \mid z) have the advantage of fast and exact sampling. However, these models have the weakness of needing to specify p(z)p(z), often with a simple fixed prior that limits the expressiveness of the model. Undirected latent variabl…

2017-12-12abs ↗pdf ↗

Study proposes a new model for joint survival annuity valuation.

problem Valuation of joint survival annuities and options.
method Linear-rational Wishart mortality model based on stochastic matrix affine process.
result Derives closed-form expression for joint survival annuity and option.

Introduces joint Shapley values to measure feature importance in models.

problem Measuring the importance of feature sets in machine learning models.
method Extends Shapley's axioms to measure a set of features' average contribution to a model's prediction.
result Joint Shapley values provide unique insights and are more consistent with local intuitions.

The paper studies Fourier-Laplace transforms in polynomial OU volatility models for option pricing.

problem Calibrating and pricing options in polynomial Ornstein-Uhlenbeck volatility models.
method Analyzes Fourier-Laplace transforms, connects to Riccati equations, and develops numerical schemes.
result Establishes existence and solution for Riccati equations and provides efficient numerical methods.

This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …

2018-12-20abs ↗pdf ↗

Joint diffusion models improve data representation for both generation and prediction.

problem Inconsistent performance between generation and classification tasks in joint models.
method Extended vanilla diffusion model with a classifier for joint end-to-end training.
result Joint diffusion model outperforms state-of-the-art hybrid methods in classification and generation.

This paper considers the problem of estimating multiple related Gaussian graphical models from a pp-dimensional dataset consisting of different classes. Our work is based upon the formulation of this problem as group graphical lasso. This paper proposes a novel hybrid covariance thresholding algorithm that can effecti…

2015-03-07abs ↗pdf ↗

Causal discovery predicts unobserved joint statistics from observed data.

problem Inferring properties of unobserved joint distributions from observed data.
method Infer causal models from observed data to predict statistical properties of unobserved sets.
result Sparse causal graphs can be more useful than dense ones in predicting unobserved joint distributions.

In an earlier work joint with X. X. Chen and G. Tian, we introduced the weak Kähler-Ricci flow for various geometric motivations. In the current work, we take further consideration on setting up the weak flow. Namely, the initial class is allowed to be no longer Kähler.

2009-09-29abs ↗pdf ↗

We formulate a new class of conditional generative models based on probability flows. Trained with maximum likelihood, it provides efficient inference and sampling from class-conditionals or the joint distribution, and does not require a priori knowledge of the number of classes or the relationships between classes. Th…

2019-02-05abs ↗pdf ↗

Though with progress, model learning and performing posterior inference still remains a common challenge for using deep generative models, especially for handling discrete hidden variables. This paper is mainly concerned with algorithms for learning Helmholz machines, which is characterized by pairing the generative mo…

2016-03-20abs ↗pdf ↗