相关论文: Algebraic Properties of Wyner Common Information S…

We consider linear models where $d$ potential causes $X_1,...,X_d$ are correlated with one target quantity $Y$ and propose a method to infer whether the association is causal or whether it is an artifact caused by overfitting or hidden…

In this paper, a class of convex feasibility problems (CFPs) are studied for multi-agent systems through local interactions. The objective is to search a feasible solution to the convex inequalities with some set constraints in a…

We study parameter identifiability of directed Gaussian graphical models with one latent variable. In the scenario we consider, the latent variable is a confounder that forms a source node of the graph and is a parent to all other nodes,…

For a finite collection $\mathbf A=(A_i)_{i\in I}$ of locally closed sets in $\mathbb R^n$, $n\geqslant3$, with the sign $\pm1$ prescribed such that the oppositely charged plates are mutually disjoint, we consider the minimum energy problem…

We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a family of CI statements, we associate a polynomial ideal…

We consider general Gaussian latent tree models in which the observed variables are not restricted to be leaves of the tree. Extending related recent work, we give a full semi-algebraic description of the set of covariance matrices of any…

Estimating causal quantities traditionally relies on bespoke estimators tailored to specific assumptions. Recently proposed Causal Foundation Models (CFMs) promise a more unified approach by amortising causal discovery and inference in a…

The input in the Minimum-Cost Constraint Satisfaction Problem (MinCSP) over the Point Algebra contains a set of variables, a collection of constraints of the form $x < y$, $x = y$, $x \leq y$ and $x \neq y$, and a budget $k$. The goal is to…

Wheeler nondeterministic finite automata (WNFAs) were introduced as a generalization of prefix sorting from strings to labeled graphs. WNFAs admit optimal solutions to classic hard problems on labeled graphs and languages. The problem of…

We prove that, for any measurable phase space subset $\Omega\subset\mathbb{R}^{2d}$ with $0<|\Omega|<\infty$ and any $1\le p < \infty$, the nonlinear concentration problem $$ \sup_{f \in…

The data drawn from biological, economic, and social systems are often confounded due to the presence of unmeasured variables. Prior work in causal discovery has focused on discrete search procedures for selecting acyclic directed mixed…

We pose the fine-grained hardness hypothesis that the textbook algorithm for the NFA Acceptance problem is optimal up to subpolynomial factors, even for dense NFAs and fixed alphabets. We show that this barrier appears in many variations…

A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency…

In the traditional Katz-Vafa method, matter representations are determined by decomposing the adjoint representation of a parent simple Lie algebra $\mathfrak{m}$ as the direct sum of irreducible representations of a semisimple subalgebra…

Estimating high-dimensional covariance matrices is a key task across many fields. This paper explores the theoretical limits of distributed covariance estimation in a feature-split setting, where communication between agents is constrained.…

We study the covariance property of quadratic time-frequency distributions with respect to the action of the extended symplectic group. We show how covariance is related, and in fact in competition, with the possibility of damping the…

We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated…

This paper has two primary objectives. First, we investigate fundamental qualitative properties of the generalized multi-source Weber problem formulated using the Minkowski gauge function. This includes proving the existence of global…

We consider the problem of extracting a common structure from multiple tensor datasets. For this purpose, we propose multilinear common component analysis (MCCA) based on Kronecker products of mode-wise covariance matrices. MCCA constructs…

Multi-omics data present significant challenges for statistical inference due to the complex interdependencies among biological layers. In this paper, we introduce a novel Multi-Omics Factor-Adjusted Cox (MOFA-Cox) model for analyzing…