English
Related papers

Related papers: On Two Distinct Sources of Nonidentifiability in L…

200 papers

Given two networks of differing sizes, it is of interest to test whether the two networks belong to the same distribution. We formalize the notion of "equality of distribution" under the framework of the generalized random dot product…

Statistics Theory · Mathematics 2026-03-10 Joshua Agterberg , Minh Tang , Carey Priebe

In many real applications that use and analyze networked data, the links in the network graph may be erroneous, or derived from probabilistic techniques. In such cases, the node classification problem can be challenging, since the…

Databases · Computer Science 2014-05-23 Michele Dallachiesa , Charu Aggarwal , Themis Palpanas

Supervised machine learning and predictive models have achieved an impressive standard today, enabling us to answer questions that were inconceivable a few years ago. Besides these successes, it becomes clear, that beyond pure prediction,…

Machine Learning · Statistics 2025-01-29 Cornelia Gruber , Patrick Oliver Schenk , Malte Schierholz , Frauke Kreuter , Göran Kauermann

When facing graph signal processing tasks, the workhorse assumption is that the graph describing the support of the signals is known. However, in many relevant applications the available graph suffers from observation errors and…

Signal Processing · Electrical Eng. & Systems 2024-12-03 Samuel Rey , Victor M. Tenorio , Antonio G. Marques

We address the problem of identifying a graph structure from the observation of signals defined on its nodes. Fundamentally, the unknown graph encodes direct relationships between signal elements, which we aim to recover from observable…

Social and Information Networks · Computer Science 2016-08-11 Santiago Segarra , Antonio G. Marques , Gonzalo Mateos , Alejandro Ribeiro

Epistemic uncertainty in neural networks is commonly modeled using two second-order paradigms: distribution-based representations, which rely on posterior parameter distributions, and set-based representations based on credal sets (convex…

Machine Learning · Computer Science 2026-02-27 Kaizheng Wang , Yunjia Wang , Fabio Cuzzolin , David Moens , Hans Hallez , Siu Lun Chau

We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sources with an arbitrary distinguishability relation. Our…

Information Theory · Computer Science 2022-07-29 Tamás Tasnádi , Péter Vrana

Deep generative models are challenging the classical methods in the field of anomaly detection nowadays. Every new method provides evidence of outperforming its predecessors, often with contradictory results. The objective of this…

Machine Learning · Computer Science 2021-06-09 Vít Škvára , Jan Franců , Matěj Zorek , Tomáš Pevný , Václav Šmídl

The goal of causal representation learning is to find a representation of data that consists of causally related latent variables. We consider a setup where one has access to data from multiple domains that potentially share a causal…

Machine Learning · Statistics 2023-10-30 Nils Sturma , Chandler Squires , Mathias Drton , Caroline Uhler

Statistical models are often structurally unidentifiable, because different sets of parameters can lead to equal model outcomes. To be useful for prediction and parameter inference from data, stochastic population models need to be…

Populations and Evolution · Quantitative Biology 2025-03-19 Jose A. Capitan , David Alonso

This paper studies the role played by identification in the Bayesian analysis of statistical and econometric models. First, for unidentified models we demonstrate that there are situations where the introduction of a non-degenerate prior…

Econometrics · Economics 2021-10-20 Jean-Pierre Florens , Anna Simoni

A class of random graph models is considered, combining features of exponential-family models and latent structure models, with the goal of retaining the strengths of both of them while reducing the weaknesses of each of them. An open…

Computation · Statistics 2020-07-21 Sergii Babkin , Jonathan Stewart , Xiaochen Long , Michael Schweinberger

Deep generative models for anomaly detection in multivariate time-series are typically trained by maximizing data likelihood. However, likelihood in observation space measures marginal density rather than conformity to structured temporal…

Artificial Intelligence · Computer Science 2026-03-13 David Baumgartner , Eliezer de Souza da Silva , Iñigo Urteaga

Complex textual information extraction tasks are often posed as sequence labeling or \emph{shallow parsing}, where fields are extracted using local labels made consistent through probabilistic inference in a graphical model with constrained…

Machine Learning · Computer Science 2018-10-01 Dung Thai , Sree Harsha Ramesh , Shikhar Murty , Luke Vilnis , Andrew McCallum

Despite the growing interest in causal and statistical inference for settings with data dependence, few methods currently exist to account for missing data in dependent data settings; most classical missing data methods in statistics and…

We provide identification results for a broad class of learning models in which continuous outcomes depend on three types of unobservables: known heterogeneity, initially unknown heterogeneity that may be revealed over time, and transitory…

Econometrics · Economics 2025-06-25 Jackson Bunting , Paul Diegert , Arnaud Maurel

Latent space models are powerful statistical tools for modeling and understanding network data. While the importance of accounting for uncertainty in network analysis has been well recognized, the current literature predominantly focuses on…

Statistics Theory · Mathematics 2025-08-15 Jinming Li , Shihao Wu , Chengyu Cui , Gongjun Xu , Ji Zhu

Modeling inter-dependencies between time-series is the key to achieve high performance in anomaly detection for multivariate time-series data. The de-facto solution to model the dependencies is to feed the data into a recurrent neural…

Machine Learning · Computer Science 2021-08-17 Yuhang Wu , Mengting Gu , Lan Wang , Yusan Lin , Fei Wang , Hao Yang

How do LLMs learn in-context? Is it by pattern-matching recent tokens, or by inferring latent structure? We probe this question using a toy graph random-walk across two competing graph structures. This task's answer is, in principle,…

Artificial Intelligence · Computer Science 2026-05-12 Katharine Kowalyshyn , Timothy Duggan , Daniel Little , Michael C Hughes

Deep generative models (DGMs) have been widely developed for graph data. However, much less investigation has been carried out on understanding the latent space of such pretrained graph DGMs. These understandings possess the potential to…

Machine Learning · Computer Science 2024-01-31 Shengchao Liu , Chengpeng Wang , Jiarui Lu , Weili Nie , Hanchen Wang , Zhuoxinran Li , Bolei Zhou , Jian Tang
‹ Prev 1 8 9 10 Next ›