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

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for dichotomic independence

Extracts the finest pattern of mutual independence from data.

problem Inferring the finest mutual independence pattern from data.
method Estimate the set of valid patterns of dichotomic independence and use their intersection to infer the finest pattern.
result The method can estimate the finest mutual independence pattern from i.i.d. realizations of a multivariate normal distribution.

This paper introduces a novel framework for designing fair and sustainable unemployment benefits, grounded in cooperative game theory and real-time fiscal policy. The labor market is modeled as a coalitional game, where a random subset of participants is employed, generating stochastic economic output. To ensure fairne…

2018-08-26abs ↗pdf ↗

Tichler proved that a manifold admitting a smooth closed one-form fibers over a circle. More generally a manifold admitting kk independent closed one-forms fibers over a torus TkT^k. In this article we explain a version of this construction for manifolds with boundary using the techniques of bb-calculus. We explore n…

2019-01-31abs ↗pdf ↗

A two-variable model is developed to forecast the probability of recession in the U.S. economy. Like many others, the model uses data a year or more old to explain movements of a dichotomous dependent variable for recession. The innovation of the present effort is the introduction of a confidence variable, which appear…

2001-08-08abs ↗pdf ↗

During the past decades, the Ising distribution has attracted interest in many applied disciplines, as the maximum entropy distribution associated to any set of correlated binary (`spin') variables with observed means and covariances. However, numerically speaking, the Ising distribution is unpractical, so alternative …

2018-03-07abs ↗pdf ↗

The dichotomous coordinate descent (DCD) algorithm has been successfully used for significant reduction in the complexity of recursive least squares (RLS) algorithms. In this work, we generalize the application of the DCD algorithm to RLS adaptive filtering in impulsive noise scenarios and derive a unified update formu…

2019-08-18abs ↗pdf ↗

Research on nearest-neighbor methods tends to focus somewhat dichotomously either on the statistical or the computational aspects -- either on, say, Bayes consistency and rates of convergence or on techniques for speeding up the proximity search. This paper aims at bridging these realms: to reap the advantages of fast …

2019-10-07abs ↗pdf ↗

The paper critiques and expands on common evaluation metrics in machine learning.

problem The common evaluation metrics like Precision, Recall, F-Measure, and Rand Accuracy are biased and misleading.
method The paper introduces new measures like Informedness, Markedness, and Correlation to better reflect the quality of predictions.
result A system that performs worse in terms of Informedness can appear better using common measures like Precision and Recall.

Study on radial solutions of Lane-Emden system on Cartan-Hadamard manifolds.

problem Existence and qualitative properties of radial solutions on Cartan-Hadamard manifolds.
method Analytical and asymptotic analysis of radial solutions, focusing on critical and supercritical exponents.
result Existence of one-parameter family of radial solutions for critical or supercritical exponents, with different dimensions of existence regions based on stochastic completeness.

Graphical models are commonly used tools for modeling multivariate random variables. While there exist many convenient multivariate distributions such as Gaussian distribution for continuous data, mixed data with the presence of discrete variables or a combination of both continuous and discrete variables poses new cha…

2014-04-29abs ↗pdf ↗

The paper proposes a test to determine the number of latent classes in ordinal categorical data.

problem Determining the correct number of latent classes in latent class models with ordinal categorical data.
method The test statistic centers the largest singular value of a normalized residual matrix by a simple sample-size adjustment.
result The test statistic converges to zero under the null hypothesis and exceeds a fixed positive constant under an under-fitted alternative.

New insights into bias-variance tradeoff for data-driven optimization under local misspecification.

problem Understanding the relative performance of SAA, IEO, and ETO under local misspecification.
method Developed a local misspecification perspective using contiguity theory in statistics.
result Explicit expressions for decision bias and geometric understanding of variance.

The study examines machine learning classification algorithms and their generalizability using Framingham Heart Study data.

problem Addressing biases and generalizability issues in machine learning classification algorithms.
method Comparison of eight machine learning classification algorithms on Framingham Heart Study data.
result Double discriminant scoring of type I is the most generalizable algorithm.

New ROC tools assess predictive abilities for any linearly ordered outcomes.

problem Fundamental restriction in ROC analysis for non-dichotomous outcomes.
method ROC movies and UROC curves for linearly ordered outcomes.
result CPA equals AUC for binary outcomes and relates to Spearman's coefficient for pairwise distinct outcomes.

Reinforcement Learning (RL) has achieved impressive performance in many complex environments due to the integration with Deep Neural Networks (DNNs). At the same time, Genetic Algorithms (GAs), often seen as a competing approach to RL, had limited success in scaling up to the DNNs required to solve challenging tasks. C…

2019-06-24abs ↗pdf ↗

A new estimator learns sparse linear models with context-dependent coefficients.

problem Sparse linear models lack flexibility compared to deep neural networks for handling feature groups.
method Contextual lasso estimator using a deep neural network with lasso regularization.
result Learned models can be sparser than standard lasso without sacrificing predictive power.

Paper analyzes minimax risks of personalized federated learning algorithms.

problem Statistical heterogeneity among clients in federated learning.
method Minimax analysis of FedAvg and local training approaches.
result Threshold for optimality between FedAvg and local training depends on data heterogeneity.

Logistic regression is commonly used for modeling dichotomous outcomes. In the classical setting, where the number of observations is much larger than the number of parameters, properties of the maximum likelihood estimator in logistic regression are well understood. Recently, Sur and Candes have studied logistic regre…

2019-06-10abs ↗pdf ↗

New framework extends ICA for non-independent variables, identifying pairwise mean independence.

problem Non-independent variables complicating ICA recovery.
method Algebraic recovery algorithm based on least-squares optimization over the orthogonal group.
result Pairwise mean independence is identifiable, robust to independence constraints.

In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this paper, we show how this representation helps performing some operations with in…

2016-12-04abs ↗pdf ↗

Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of nn objects scales factorially in nn. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impo…

2010-06-07abs ↗pdf ↗

A new method tests conditional independence by transforming it into an unconditional problem using transport maps.

problem Testing conditional independence between two random vectors given a third.
method Constructing transport maps to transform conditional independence into unconditional independence, estimating these maps from data using conditional continuous normalizing flow models.
result The proposed method is validated through simulations and real-data analysis, demonstrating practical effectiveness.

The paper explores how semantic independence can be captured in text embeddings using partial orthogonality.

problem Capturing semantic independence in text embeddings.
method Developed a theory and methods based on partial orthogonality to demonstrate semantic independence.
result Partial orthogonality captures semantic independence in text embeddings.

Independent Component Analysis (ICA) - one of the basic tools in data analysis - aims to find a coordinate system in which the components of the data are independent. In this paper we present Multiple-weighted Independent Component Analysis (MWeICA) algorithm, a new ICA method which is based on approximate diagonalizat…

2019-05-31abs ↗pdf ↗

Derives derivatives and geometric framework for functions with non-independent variables.

problem Characterizing functions with non-independent variables in probabilistic models.
method Derives actual and dependent partial derivatives, dependent Jacobian matrix, and tensor metric.
result Derives gradient, Hessian, and Taylor expansion for functions with non-independent variables.

This work explores the connection between distances and kernels for conditional independence.

problem Measuring conditional independence in various fields like causal discovery and feature selection.
method Investigates the relationship between conditional independence measures induced by distances and reproducing kernels.
result Some kernel-based conditional independence measures are not equivalent to distance-based measures.

This work develops a non-parametric test for relational independence in non-i.i.d. data.

problem Testing independence in relational systems where data samples are not i.i.d.
method Kernel mean embedding for relational variables, consistent non-parametric scalable kernel test.
result Empirically validated effectiveness compared to state-of-the-art tests.

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.

We study 'meta-dependence' in conditional independence tests across different empirical distributions.

problem Understanding the breakdown of conditional independence properties in finite data.
method Geometric intuition and information projections to measure meta-dependence between conditional independences.
result We provide a measure of meta-dependence that consolidates findings across synthetic and real-world data.

Method discovers local independence in systems with continuous variables.

problem Applying Context-Specific Independence (CSI) to continuous variables is impractical.
method Neural contextual decomposition (NCD) learns partition of joint outcome space.
result NCD successfully discovers local independence in synthetic and real-world systems.

TCRI improves domain generalization by enforcing conditional independence constraints.

problem Limitations of existing domain generalization methods due to incomplete constraints.
method TCRI implements regularizers motivated by conditional independence constraints.
result TCRI achieves cross-domain stability and outperforms baselines in worst-domain accuracy.

In this article, we define an independence system for a classical knot diagram and prove that the independence system is a knot invariant for alternating knots. We also discuss the exchange property for minimal unknotting sets. Finally, we show that there are knot diagrams where the independence system is a matroid and…

2017-06-15abs ↗pdf ↗