Related papers: On the choice of weights in aggregate compositiona…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
We introduce an informative probabilistic association matrix to measure a proportional local-to-global association of categories of one variable with another categorical variable. Towards a probability based proportional prediction, the…
In this work, we study whether enforcing strict compositional structure in sequence embeddings yields meaningful geometric organization when applied to protein-protein interaction networks. Using Event2Vec, an additive sequence embedding…
This paper describes a Bayesian method for combining an arbitrary mixture of observational and experimental data in order to learn causal Bayesian networks. Observational data are passively observed. Experimental data, such as that produced…
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that compress the data efficiently. As a compression technique we…
Applied work often studies the effect of a binary variable ("treatment") using linear models with additive effects. I study the interpretation of the OLS estimands in such models when treatment effects are heterogeneous. I show that the…
In this article, a framework for defining and analysing a family of graphs or networks from symbolic music information is discussed. Such graphs concern different types of elements, such as pitches, chords and rhythms, and the relations…
Aggregate computation in relational databases has long been done using the standard unary aggregation and binary join operators. These implement the classical model of computing joins between relations two at a time, materializing the…
The use of a hypothetical generative model was been suggested for causal analysis of observational data. The very assumption of a particular model is a commitment to a certain set of variables and therefore to a certain set of possible…
Compositional data are met in many different fields, such as economics, archaeometry, ecology, geology and political sciences. Regression where the dependent variable is a composition is usually carried out via a log-ratio transformation of…
For exchangeable data, mixture models are an extremely useful tool for density estimation due to their attractive balance between smoothness and flexibility. When additional covariate information is present, mixture models can be extended…
A common approach to aggregate classification estimates in an ensemble of decision trees is to either use voting or to average the probabilities for each class. The latter takes uncertainty into account, but not the reliability of the…
The weighting of critical-point samples in the weighted randomized maximum likelihood method depend on the magnitude of the data mismatch at the critical points and on the Jacobian of the transformation from the prior density to the…
In this review, we discuss approaches for learning causal structure from data, also called causal discovery. In particular, we focus on approaches for learning directed acyclic graphs (DAGs) and various generalizations which allow for some…
Task vectors capture how a model changes during fine-tuning by recording the difference between pre-trained and task-specific weights. The composition of task vectors, a key operator in task arithmetic, enables models to integrate knowledge…
In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…
We study the complex symmetric structure of weighted composition--differentiation operators of order $n $ on the weighted Bergman spaces $A_{\alpha}^2$ with respect to some conjugations. Then we provide some examples of these operators.
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical formulation of this problem, where operations on state-based…
Certain weight-based orders on the free associative algebra $R = k<x_1, ..., x_t >$ can be specified by $t \times \infty$ arrays whose entries come from the subring of nonnegative elements in a totally ordered field. Such an array $A$…