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

17335066 · May 202619922001200920172026
48 results for joint mixability

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.

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.

Empirical risk minimization (ERM) is a fundamental learning rule for statistical learning problems where the data is generated according to some unknown distribution P\mathsf{P} and returns a hypothesis ff chosen from a fixed class F\mathcal{F} with small loss \ell. In the parametric setting, depending upon $(\ell…

2014-06-14abs ↗pdf ↗

Mixability of a loss is known to characterise when constant regret bounds are achievable in games of prediction with expert advice through the use of Vovk's aggregating algorithm. We provide a new interpretation of mixability via convex analysis that highlights the role of the Kullback-Leibler divergence in its definit…

2014-03-10abs ↗pdf ↗

Optimal algorithms for mixable losses in dynamic environments with reduced redundancy.

problem Online optimization of mixable loss functions in a dynamic environment.
method Introduce online mixture schemes with polynomial and logarithmic time complexities.
result Achieves optimal redundancy up to a constant multiplicity gap.

Near-logarithmic regret per switch achieved for mixable/exp-concave losses.

problem Online optimization of mixable loss functions with dynamic environments.
method Online mixture framework using static solvers and hyper-expert creations.
result Near-logarithmic regret per switch with sub-polynomial complexity.

The goal of online prediction with expert advice is to find a decision strategy which will perform almost as well as the best expert in a given pool of experts, on any sequence of outcomes. This problem has been widely studied and O(T)O(\sqrt{T}) and O(logT)O(\log{T}) regret bounds can be achieved for convex losses (\cite{zin…

2018-05-20abs ↗pdf ↗

The speed with which a learning algorithm converges as it is presented with more data is a central problem in machine learning --- a fast rate of convergence means less data is needed for the same level of performance. The pursuit of fast rates in online and statistical learning has led to the discovery of many conditi…

2015-07-09abs ↗pdf ↗

Improved multiclass logistic regression with lower computational complexity.

problem High computational complexity in existing methods for multiclass logistic regression.
method Developed a new algorithm that achieves a lower computational complexity.
result Achieved a regret of O(log(Bn))O(\log(Bn)) with computational complexity O(n1.5)O(n^{1.5}).

The paper examines risk aggregation under mixtures of marginals, finding that more homogeneous distributions lead to larger uncertainty.

problem Investigating the impact of mixing on risk aggregation uncertainty.
method Analyzes ordering relations and inequalities for aggregation sets under distribution and quantile mixtures.
result More homogeneous marginals result in larger aggregation sets, indicating greater model uncertainty.

Probabilistic forecasts in the form of probability distributions over future events have become popular in several fields of statistical science. The dissimilarity between a probability forecast and an outcome is measured by a loss function (scoring rule). Popular example of scoring rule for continuous outcomes is the …

2019-02-26abs ↗pdf ↗

Gaptron algorithm reduces mistakes in online multiclass classification.

problem Online multiclass classification with limited information.
method Randomized first-order algorithm exploiting the gap between zero-one loss and surrogate losses.
result First linear time algorithm with O(KT)O(K\sqrt{T}) expected regret.

We discuss the general properties of the theory of joint invariants of a smooth Lie group action in a manifold. Many of the known results about differential invariants, including Lie's finiteness theorem, have simpler versions in the context of joint invariants. We explore the relation between joint and differential in…

2014-10-29abs ↗pdf ↗

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.

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.

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.

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.

Proposes joint LCA for multiview data to identify shared and view-specific components.

problem Extracting shared components sequentially from multiview data.
method Formulates a matrix decomposition model with joint and individual structures, proposes a penalty term objective function, and employs a refitting procedure.
result Achieves simultaneous estimation and rank selection for cross covariance.

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.

The Neural Testbed evaluates joint predictions of neural agents, revealing their limitations.

problem Evaluating the quality of joint predictions generated by neural agents.
method Developed an open-source benchmark (The Neural Testbed) to assess agents' marginal and joint predictions.
result Popular Bayesian deep learning agents perform poorly on joint predictions, even with accurate marginal predictions.

We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition.…

2016-07-02abs ↗pdf ↗

We employ the language of Cartan's geometry to present a model for studying vector spaces of Killing two-tensors defined in pseudo-Riemannian spaces of constant curvature under the action of the corresponding isometry group. We also discuss geometric properties of joint invariants of Killing two-tensors defined in the …

2006-12-19abs ↗pdf ↗

This work proposes a new method to estimate joint probability from pairwise marginals, reducing sample complexity.

problem Direct nonparametric estimation of high-dimensional joint probability is infeasible due to the curse of dimensionality.
method Developed a coupled nonnegative matrix factorization (CNMF) framework using only pairwise marginals.
result The method provably recovers the joint probability mass function up to bounded error in finite iterations under reasonable conditions.

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.

Novel approach for estimating joint probability densities using tensor decompositions and dictionaries.

problem Estimating joint probability densities of mixed discrete and continuous variables.
method Low-rank tensor decomposition combined with dictionary learning.
result Better classification and lower error rates compared to existing methods.

Analyzing a comprehensive news dataset, we document that joint news coverage triggers attention contagion, causing temporarily inflated valuations for affected stocks. Tracing SEC EDGAR visits from unique IPs, we provide direct evidence of attention spillovers between stocks. Stocks with greater joint news coverage exh…

2017-03-08abs ↗pdf ↗

Researchers derived formulas for joint moments of elliptical distributions.

problem Calculating joint moments of elliptical distributions.
method Used Stein's lemma and two different methods to derive expressions.
result New formulae for expectations of product of normally distributed random variables and simplified expressions for other distributions.

Better signal detection in undersampled data using joint and cross covariances.

problem Detecting shared signals in high-dimensional data with limited samples.
method Analysis of three covariance matrices: individual, cross, and joint.
result Joint and cross covariance matrices detect signals earlier than individual covariances.

Learning linear predictors with the logistic loss---both in stochastic and online settings---is a fundamental task in machine learning and statistics, with direct connections to classification and boosting. Existing "fast rates" for this setting exhibit exponential dependence on the predictor norm, and Hazan et al. (20…

2018-03-25abs ↗pdf ↗

The paper presents a method to estimate joint interventional distributions from marginal interventional data.

problem Estimating joint interventional distributions from marginal interventional data.
method The paper extends the Causal Maximum Entropy method to use interventional data and employs Lagrange duality to prove the solution lies in the exponential family.
result The method allows for causal feature selection and inference of joint interventional distributions.