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.
To each unit complex number with positive imaginary part there is defined a Tristram-Levine knot signature function. The set of all such signature functions is linearly independent as a set of functions defined on the set of all knots. The set of averaged signature functions forms a linearly independent set of homomoro…
The number of functionally independent scalar invariants of arbitrary order of a generic pseudo--Riemannian metric on an n--dimensional manifold is determined.
Constructs independent bases for cubic curve families using Hessian structures.
problem Finding independent bases for cubic curve families.
method Uses a Hessian structure to define a cost function for constructing bases.
result Constructs valuatively independent bases for H0(X,Lk). New research challenges the independence assumption in neurosymbolic learning, leading to overconfident predictions and unrepresentable uncertainty.
problem The independence assumption in neurosymbolic learning systems can lead to overconfident predictions and hinder uncertainty quantification.
method The study proves the limitations of the independence assumption and introduces new loss functions that are non-convex and difficult to optimise.
result Neurosymbolic learning systems using the independence assumption are prone to overconfidence and cannot represent uncertainty over multiple valid options.
We present a novel method for learning a set of disentangled reward functions that sum to the original environment reward and are constrained to be independently obtainable. We define independent obtainability in terms of value functions with respect to obtaining one learned reward while pursuing another learned reward…
The paper analyzes counterfactual invariance and its relation to conditional independence.
problem Understanding the relationship between counterfactual invariance and conditional independence.
method Theoretical analysis of existing definitions, graphical implications, and mathematical proofs.
result Counterfactual invariance implies conditional independence, but not the other way around.
Constructs unique bases for CY varieties over valued fields.
problem Finding unique bases for CY varieties over valued fields.
method Uses techniques from higher rank degenerations in K-stability.
result Induces canonical functions on skeletons and agrees with tropicalizations of theta functions.
Paper introduces a nonparametric functional graphical model for random functions.
problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.
RI-DeepONet learns neural operators from arbitrary sensor data.
problem Discretization of input functions limits practical applications of DeepONet.
method Introduces RI-DeepONet and two dictionary learning algorithms for INRs.
result RINO handles arbitrary sensor data robustly and applies to various problems.
The paper shows how to infer conditional independence from non-Gaussian data.
problem Inferring conditional independence from non-Gaussian distributions.
method Developed a method to recover conditional independence structure from the precision matrix of generalized nonparanormal data.
result The conditional independence structure can be inferred from the precision matrix of generalized nonparanormal data.
New algorithms for RL in Markov games with independent linear function approximation, breaking the curse of multiagents.
problem Tackles the challenge of learning Markov equilibria in large state space Markov games with multiple agents.
method Proposes independent linear Markov games and designs new algorithms for learning Markov coarse correlated equilibria and Markov correlated equilibria with polynomial sample complexity.
result Breaks the curse of multiagents by achieving sample complexity bounds that scale polynomially with each agent's function class complexity.
New method exploits independence in instrumental variable models for better causal inference.
problem Identify causal functions in the presence of unobserved confounders.
method HSIC-X method that exploits independence between response, hidden confounders, and instruments.
result The method provides better finite sample results and is invariant to distributional shifts.
We investigate the use of a non-parametric independence measure, the Hilbert-Schmidt Independence Criterion (HSIC), as a loss-function for learning robust regression and classification models. This loss-function encourages learning models where the distribution of the residuals between the label and the model predictio…
A frame independent formulation of analytical mechanics in the Newtonian space-time is presented. The differential geometry of affine values i.e., the differential geometry in which affine bundles replace vector bundles and sections of one dimensional affine bundles replace functions on manifolds, is used. Lagrangian a…
A new method tests independence for causal discovery on discrete data.
problem Inferring causal directions on discrete and categorical data.
method Subsampling-based method to test independence between cause and mechanism.
result Our method works for both discrete and categorical data without functional model assumptions.
IMA improves representation learning even when assumptions are violated.
problem Recovering true latent codes from mixed data.
method IMA, which assumes independent causal mechanisms.
result IMA's benefits extend to violations of its assumptions.
The study describes Nijenhuis operators with specific properties.
problem Characterizing Nijenhuis operators with functional independence and determinant constraints.
method Proving the general form and describing the specific case of Nijenhuis operators.
result Complete description of Nijenhuis operators with nondegenerate determinant.
We develop a new framework of uncertainty variables to model uncertainty. An uncertainty variable is characterized by an uncertainty set, in which its realization is bound to lie, while the conditional uncertainty is characterized by a set map, from a given realization of a variable to a set of possible realizations of…
This research tackles group fairness in predictive process monitoring by ensuring predictions are independent of sensitive group membership.
problem Predictive models using biased historical data can perpetuate unfair behavior in new cases.
method Investigates independence through metrics like ΔDP and a composite loss function balancing predictive performance and fairness.
result Proposes and validates a composite loss function for training models that balance fairness and performance.
The paper investigates quantitative rigidity using Colding's monotonicity formulas for Ricci curvature.
problem Quantifying rigidity in manifolds with nonnegative Ricci curvature.
method Investigates pinching of Colding's monotone functionals and constructs k-splitting functions. result Quantitative control of splitting functions by pinching at independent points controls the distance to the nearest cone.
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.
Let X be the moduli space of SL(3,C) representations of a free group of rank r. In this paper we describe maximal algebraically independent subsets of certain minimal sets of coordinate functions on X. These subsets locally parametrize the moduli space.
The study proves properties of intersections of horospheres in harmonic spaces.
problem Properties of intersections of horospheres in harmonic spaces.
method Constructing volume preserving mappings using Busemann functions.
result Upper bound of the volume of intersection of horospheres is independent of Busemann function differences.
DDICA separates nonlinear mixed signals robustly.
problem Blind source separation of nonlinear mixed signals.
method Deep deterministic neural network with matrix-based entropy function.
result DDICA effectively separates independent components with high accuracy.
Proposes a method to estimate functional graphical models from multivariate random functions.
problem Estimating conditional independence structure of multivariate random functions.
method Neighborhood selection approach combining function-on-function regression and graph recovery.
result Statistical consistency of the method in high-dimensional settings.
Alternative to likelihood-based LSNM model selection, residual independence testing is more robust to noise misspecification.
problem Cause-effect inference in location-scale noise models with misspecified noise distributions.
method Residual independence testing as an alternative to likelihood-based model selection.
result Residual independence testing is more robust to noise misspecification.
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 method for optimization on Hadamard manifolds with curvature-independent guarantees.
problem Curvature-dependent complexity in geodesic convex optimization.
method Introducing horospherical convexity and developing algorithms for optimization.
result Curvature-independent convergence of subgradient descent and Nesterov's method.
InClass nets use neural networks to estimate CIMMs without assuming fixed parameters.
problem Nonparametric estimation of conditional independence mixture models.
method Independent classifier neural networks (NNs) for multi-class classification.
result Nonparametric identifiability conditions for bivariate CIMMs.
The paper develops a neural network method for estimating drift functions of diffusion processes from discrete observations.
problem Nonparametric estimation of drift function for diffusion processes from high-frequency discrete observations.
method Neural network-based estimator for drift function estimation.
result Derives a non-asymptotic convergence rate for the neural network estimator.
New method for separating mixed signals with nonlinear functions.
problem Recovering source signals from nonlinear mixtures.
method Optimisation-based function approximation to minimize mutual statistical dependence.
result The method can recover source signals from nonlinear mixtures under certain conditions.
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.
We show that the error probability of reconstructing kernel matrices from Random Fourier Features for the Gaussian kernel function is at most O(R2/3exp(−D)), where D is the number of random features and R is the diameter of the data domain. We also provide an information-theoretic method-independen…
We consider the problem of finding model-independent bounds on the price of an Asian option, when the call prices at the maturity date of the option are known. Our methods differ from most approaches to model-independent pricing in that we consider the problem as a dynamic programming problem, where the controlled proc…
We present a generalization of independent component analysis (ICA), where instead of looking for a linear transform that makes the data components independent, we look for a transform that makes the data components well fit by a tree-structured graphical model. Treating the problem as a semiparametric statistical prob…
This work closes the gap between theory and practice for nICA identifiability.
problem Identifying latent components in nonlinearly mixed data.
method Finite-sample analysis of GCL-based nICA, combining GCL properties, statistical generalization, and numerical differentiation.
result Establishes a trade-off between function learner complexity and expressiveness.
SPQR improves Q-ensemble diversity in reinforcement learning.
problem Overestimation bias in Q-learning for complex tasks.
method Introduces SPQR for Q-ensemble independence regularization.
result SPQR outperforms baseline algorithms in online and offline RL benchmarks.
We establish dimension-independent estimates related to heat operators e^{tL} on manifolds. We first develop a very general contractivity result for Markov kernels which can be applied to diffusion semigroups. Second, we develop estimates on the norm behavior of harmonic and non-negative subharmonic functions. We apply…
We solve the ANOVA decomposition for categorical inputs.
problem Lack of a closed-form expression for ANOVA decomposition with categorical dependent variables.
method Bridge functional analysis with discrete Fourier analysis to derive a closed-form decomposition.
result Closed-form decomposition for categorical inputs without assumptions.
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…
Extends PD-NJ-ODE to noisy observations and dependent observation times.
problem Predicting continuous-time stochastic processes with irregular and noisy observations.
method Extends PD-NJ-ODE to handle conditional independence and noisy observations.
result Theoretical guarantees and empirical examples for handling noisy observations and dependent observation times.
Randomly initialized wide neural networks with zero-mean activations are nearly independent, potentially solving AI interpretability limits.
problem Measuring the limits of AI interpretability.
method Randomly initialized neural networks with large width and zero-mean activation functions.
result Neural networks with zero-mean activations are nearly independent, solving the computational no-coincidence conjecture.
Independent component analysis (ICA) is a widespread data exploration technique, where observed signals are modeled as linear mixtures of independent components. From a machine learning point of view, it amounts to a matrix factorization problem with a statistical independence criterion. Infomax is one of the most used…
Independent component analysis (ICA) is a powerful method for blind source separation based on the assumption that sources are statistically independent. Though ICA has proven useful and has been employed in many applications, complete statistical independence can be too restrictive an assumption in practice. Additiona…
New method for learning causal relationships in PNL models.
problem Learning causal relationships from empirical observations in PNL models.
method Rank-based methods to estimate non-linear functions, disentangling from independence tests.
result Consistent method for PNL causal discovery, validated in experiments.
Koopman Regularization learns governing equations from sparse data.
problem Learning governing equations from sparse and corrupted data.
method Constrained optimization using Koopman Eigenfunctions.
result Restores dynamics precisely with minimal assumptions.
New ICA method for sources with mixed spectra.
problem Inaccurate separation of sources with temporal autocorrelations and mixed spectra.
method Estimates spectral density functions and line spectra using cubic splines and indicator functions, then maximizes the Whittle likelihood function.
result Outperforms existing ICA methods in simulations and EEG data applications.