New learnability concept shown independent of ZFC axioms.
problem Learnability of finite subsets on [0,1] interval is undecidable.
method Set-theoretic techniques to prove independence of ZFC.
result EMX learnability of finite subsets on [0,1] is independent of ZFC.
Learning rule consistency tied to non-existence of real-valued measurable cardinals.
problem Consistency of k-NN learning rule in metric spaces.
method Analyzing separable subspaces and density conditions.
result The k-NN classifier's consistency depends on the absence of real-valued measurable cardinals.
Paper establishes robust no-arbitrage conditions under projective determinacy.
problem Understanding financial models under Knightian uncertainty.
method Adopting a projective framework, treating all model components uniformly in terms of measurability.
result Establishes characterizations of robust no-arbitrage condition under PD.
We extend a recently proposed 1-nearest-neighbor based multiclass learning algorithm and prove that our modification is universally strongly Bayes-consistent in all metric spaces admitting any such learner, making it an "optimistically universal" Bayes-consistent learner. This is the first learning algorithm known to e…
The paper explores learning from label proportions, showing differences in efficiency between LLP and PAC learning.
problem Learning from label proportions (LLP) in unlabeled data with given label proportions.
method Formal definition and computational complexity analysis of LLP learning.
result LLP learning is more restrictive than PAC learning for finite VC classes, and some classes are uncharacterizable.
PAC learning sample complexity is decidable with finite support bounds.
problem Determining the exact sample complexity for PAC learning concepts.
method Observation and proof of decidability with a-priori bounds.
result Sample complexity can be exactly determined for various concepts with finite support bounds.
We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the following bizarre situation. Čech cohomology is an invariant of shape, and a fortiori …
Proper learning is possible with labeled data, but unlabeled data can improve performance.
problem Problems that can only be learned improperly, like multiclass classification.
method Distributional regularization and worst-case performance evaluation.
result Proper learnability is possible under certain conditions involving unlabeled data.
Uniform interpretation of group theory in manifold homeomorphisms.
problem Understanding group properties in manifold homeomorphisms.
method First order theory interpretation of second order group theory.
result Many group theory problems encoded in homeomorphism groups.
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…
Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of n objects scales factorially in n. 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…
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.
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.
Topological Pontryagin classes are algebraically independent in high-dimensional spaces.
problem Algebraic independence of topological Pontryagin classes.
method Analyzing rationalised cohomology of BTop(d).
result Topological Pontryagin classes are algebraically independent.
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…
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.
New algorithms find half-optimal independent sets in sparse graphs.
problem Finding large independent sets in sparse random graphs.
method Low-degree polynomial algorithms.
result Low-degree polynomial algorithms can find independent sets of half-optimal size.
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.
Develops a new framework for conditional independence.
problem Generalizing previous notions of conditional independence.
method Introduces transition probability spaces and transitional random variables.
result Satisfies all desired relevance relations except symmetry.
New method recovers causal order from dependent data.
problem Causal discovery methods fail with shared volatility or common scale effects.
method Linear Mean-Independent Acyclic Model (LiMIAM) with mean-independence restrictions.
result Compatible causal order can be recovered from dependent disturbances.
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…
Paper optimizes approximating high-dimensional diffusions by independent coordinates.
problem Optimizing approximations of high-dimensional diffusions by independent coordinates.
method Introduces independent projection as optimal for two criteria.
result Independent projection is optimal for two criteria related to entropy and convergence.
Learning the Markov network structure from data is a problem that has received considerable attention in machine learning, and in many other application fields. This work focuses on a particular approach for this purpose called independence-based learning. Such approach guarantees the learning of the correct structure …
Estimates marginal independence structure of Bayesian networks from data.
problem Learning the marginal independence structure of Bayesian networks from observational data.
method Using Gröbner basis and MCMC method (GrUES) to connect and recover the true structure.
result GrUES recovers the true marginal independence structure at a higher rate than simple independence tests.
The independence of Central Banks is shown to be a myth.
problem The independence of Central Banks is questioned as a flawed concept.
method Analyzes the arguments for Central Bank independence and demonstrates their logical flaws.
result The independence of Central Banks is found to be a chimera.
This note shows how independent elliptical distributions minimize the Wasserstein distance.
problem Minimizing the Wasserstein distance between elliptical distributions.
method Analyzing the Wasserstein distance between independent elliptical distributions with the same density generators.
result Independent elliptical distributions minimize their Wasserstein distance from other elliptical distributions with the same density generators.
Neurosymbolic predictors fail to model uncertainty under independence assumption.
problem Neurosymbolic predictors' reliance on independence assumption limits their ability to model uncertainty.
method Formal analysis of NeSy predictors under independence assumption.
result Assuming independence among symbolic concepts prevents NeSy predictors from representing uncertainty.
New approach tackles nonidentifiability in nonlinear blind source separation.
problem Nonidentifiability in nonlinear blind source separation.
method Independent mechanism analysis, incorporating causal assumptions.
result Empirical and theoretical evidence shows improved identifiability.
Entropy regularized OT test assesses independence between samples.
problem Testing independence between two samples.
method Entropy regularized optimal transport.
result Non-asymptotic bounds for test statistic established.
Determinantal point process have recently been used as models in machine learning and this has raised questions regarding the characterizations of conditional independence. In this paper we investigate characterizations of conditional independence. We describe some conditional independencies through the conditions on t…
Bayesian test assesses conditional independence between variables.
problem Quantifying dependence or independence between variables given a third.
method Uses Polya tree priors on conditional probability densities.
result Provides a Bayesian measure of conditional dependence or independence.
New knots show linear independence in slice concordance.
problem Understanding the structure of rationally slice knots.
method Provided an infinite family of knots that are linearly independent.
result Found knots that are linearly independent and infinite order.
Conditional independence testing is an important problem, especially in Bayesian network learning and causal discovery. Due to the curse of dimensionality, testing for conditional independence of continuous variables is particularly challenging. We propose a Kernel-based Conditional Independence test (KCI-test), by con…
Constraint-based structure learning algorithms infer the causal structure of multivariate systems from observational data by determining an equivalent class of causal structures compatible with the conditional independencies in the data. Methods based on additive-noise (AN) models have been proposed to further discrimi…
LCIT tests conditional independence using latent representations.
problem Detecting conditional independencies in statistical and machine learning tasks.
method Generative framework for learning latent representations of target variables X and Y, then testing for remaining dependencies.
result LCIT outperforms state-of-the-art baselines consistently under different metrics and settings.
This work investigates the intersection property of conditional independence. It states that for random variables A,B,C and X we have that X independent of A given B,C and X independent of B given A,C implies X independent of (A,B) given C. Under the assumption that the joint distribution has a co…
Path-independent equilibrium models improve network performance on harder problems.
problem Improving network performance on harder problem instances.
method Investigated path-independent equilibrium models and their impact on network performance.
result Path independence correlates with better performance on harder problem instances.
The paper characterizes measures preserving independence through planar web geometry.
problem Characterizing measures with preserved independence.
method Planar web geometry and inhomogeneous Abelian functional equations.
result The independence-preserving property is preserved by coordinatewise reparametrizations and forms a natural invariant.
Paper introduces a new test for conditional independence using weighted partial copulas.
problem Testing conditional independence between variables.
method The approach uses a weighted partial copula function and a bootstrap procedure to compute regions of rejection.
result The proposed test has competitive power compared to existing methods.
New test for conditional independence using kernel embeddings.
problem Testing conditional independence in high-dimensional settings.
method Analytic kernel embeddings, asymptotic distribution.
result New test outperforms existing methods in high-dimensional settings.
The new notion of maturity-independent risk measures is introduced and contrasted with the existing risk measurement concepts. It is shown, by means of two examples, one set on a finite probability space and the other in a diffusion framework, that, surprisingly, some of the widely utilized risk measures cannot be used…