Mariano Beguerisse-Díaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mariano Beguerisse-Díaz has a total of 76 co-authors. Here are the top co-authors by number of shared publications:
- Mauricio Barahona
Department of Mathematics, Imperial College London, London, United Kingdom
14 shared publications Guillermo Garduño-Hernández
Sinnia, Mexico City, Mexico
6 shared publications- Mason A. Porter
Department of Mathematics, University of California, Los Angeles, Los Angeles, USA
4 shared publications Borislav Vangelov
Department of Mathematics, Imperial College London, London SW7 2AZ, UK
3 shared publicationsRadhika Desikan
Department of Life Sciences, Imperial College London, London SW7 2AZ, UK
3 shared publications- Amy Kathleen McLennan
School of Anthropology and Museum Ethnography, University of Oxford, United Kingdom
2 shared publications
Latest Publications
- Open Access
ViSMaP: Unsupervised Hour-long Video Summarisation by Meta-Prompting
We introduce ViSMap: Unsupervised Video Summarisation by Meta Prompting, a system to summarise hour long videos with no-supervision. Most existing video understanding models work well on short videos of pre-segmented events, yet they struggle to summarise longer videos where relevant events are sparsely distributed and not pre-segmented. Moreover, long-form video understanding often relies on supervised hierarchical training that needs extensive annotations which are costly, slow and prone to inconsistency. With ViSMaP we bridge the gap between short videos (where annotated data is plentiful) and long ones (where it's not). We rely on LLMs to create optimised pseudo-summaries of long videos using segment descriptions from short ones. These pseudo-summaries are used as training data for a model that generates long-form video summaries, bypassing the need for expensive annotations of long videos. Specifically, we adopt a meta-prompting strategy to iteratively generate and refine creating pseudo-summaries of long videos. The strategy leverages short clip descriptions obtained from a supervised short video model to guide the summary. Each iteration uses three LLMs working in sequence: one to generate the pseudo-summary from clip descriptions, another to evaluate it, and a third to optimise the prompt of the generator. This iteration is necessary because the quality of the pseudo-summaries is highly dependent on the generator prompt, and varies widely among videos. We evaluate our summaries extensively on multiple datasets; our results show that ViSMaP achieves performance comparable to fully supervised state-of-the-art models while generalising across domains without sacrificing performance. Code will be released upon publication.
Open AccessViSMaP: Unsupervised Hour-long Video Summarisation by Meta-Prompting
We introduce ViSMap: Unsupervised Video Summarisation by Meta Prompting, a system to summarise hour long videos with no-supervision. Most existing video understanding models work well on short videos of pre-segmented events, yet they struggle to summarise longer videos where relevant events are sparsely distributed and not pre-segmented. Moreover, long-form video understanding often relies on supervised hierarchical training that needs extensive annotations which are costly, slow and prone to inconsistency. With ViSMaP we bridge the gap between short videos (where annotated data is plentiful) and long ones (where it's not). We rely on LLMs to create optimised pseudo-summaries of long videos using segment descriptions from short ones. These pseudo-summaries are used as training data for a model that generates long-form video summaries, bypassing the need for expensive annotations of long videos. Specifically, we adopt a meta-prompting strategy to iteratively generate and refine creating pseudo-summaries of long videos. The strategy leverages short clip descriptions obtained from a supervised short video model to guide the summary. Each iteration uses three LLMs working in sequence: one to generate the pseudo-summary from clip descriptions, another to evaluate it, and a third to optimise the prompt of the generator. This iteration is necessary because the quality of the pseudo-summaries is highly dependent on the generator prompt, and varies widely among videos. We evaluate our summaries extensively on multiple datasets; our results show that ViSMaP achieves performance comparable to fully supervised state-of-the-art models while generalising across domains without sacrificing performance. Code will be released upon publication.
- Open Access
- 15 November 2024
- Published by Springer Nature in EPJ Data Science
- Vol. 13 (1) , 1-21
Consumption-based approaches in proactive detection for content moderation
- 15 November 2024
- Published by Springer Nature in EPJ Data Science
- Vol. 13 (1) , 1-21
Open AccessConsumption-based approaches in proactive detection for content moderation
- Open Access
Topological fingerprints for audio identification
We present a topological audio fingerprinting approach for robustly identifying duplicate audio tracks. Our method applies persistent homology on local spectral decompositions of audio signals, using filtered cubical complexes computed from mel-spectrograms. By encoding the audio content in terms of local Betti curves, our topological audio fingerprints enable accurate detection of time-aligned audio matchings. Experimental results demonstrate the accuracy of our algorithm in the detection of tracks with the same audio content, even when subjected to various obfuscations. Our approach outperforms existing methods in scenarios involving topological distortions, such as time stretching and pitch shifting.
Open AccessTopological fingerprints for audio identification
We present a topological audio fingerprinting approach for robustly identifying duplicate audio tracks. Our method applies persistent homology on local spectral decompositions of audio signals, using filtered cubical complexes computed from mel-spectrograms. By encoding the audio content in terms of local Betti curves, our topological audio fingerprints enable accurate detection of time-aligned audio matchings. Experimental results demonstrate the accuracy of our algorithm in the detection of tracks with the same audio content, even when subjected to various obfuscations. Our approach outperforms existing methods in scenarios involving topological distortions, such as time stretching and pitch shifting.
- Open Access
- 6 November 2021
- Published by Elsevier in SSRN Electronic Journal
Minimizing Congestion in Single-Source, Single-Sink Queueing Networks
We study queueing networks with a single source and a single sink. We assume that walkers traverse a network according to an unbiased random walk, and we analyze how network topology affects the total mean queue size $Q$, which we use to measure congestion. We examine network topologies that minimize $Q$ and provide proofs for some cases and numerical evidence of optimality for others. Finally, we present greedy algorithms that add and delete edges from a network to reduce $Q$, and we apply these algorithms to a supermarket store layout. We find that these greedy algorithms, which typically tend to add edges to the sink node, are able to significantly reduce $Q$. Our work helps improve understanding of how to design networks with low congestion and to amend networks to reduce congestion.- 6 November 2021
- Published by Elsevier in SSRN Electronic Journal
Open AccessMinimizing Congestion in Single-Source, Single-Sink Queueing Networks
We study queueing networks with a single source and a single sink. We assume that walkers traverse a network according to an unbiased random walk, and we analyze how network topology affects the total mean queue size $Q$, which we use to measure congestion. We examine network topologies that minimize $Q$ and provide proofs for some cases and numerical evidence of optimality for others. Finally, we present greedy algorithms that add and delete edges from a network to reduce $Q$, and we apply these algorithms to a supermarket store layout. We find that these greedy algorithms, which typically tend to add edges to the sink node, are able to significantly reduce $Q$. Our work helps improve understanding of how to design networks with low congestion and to amend networks to reduce congestion. - Open Access
- 28 June 2021
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 3 (2) , 023249
Opinion dynamics on tie-decay networks
In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions. Specifically, we formulate continuous-time Laplacian dynamics and a discrete-time DeGroot model of opinion dynamics on these tie-decay networks, and we carry out numerical computations for the continuous-time Laplacian dynamics. We examine the speed of convergence by studying the spectral gaps of combinatorial Laplacian matrices of tie-decay networks. First, we compare the spectral gaps of the Laplacian matrices of tie-decay networks that we construct from empirical data with the spectral gaps for corresponding randomized and aggregate networks. We find that the spectral gaps for the empirical networks tend to be smaller than those for the randomized and aggregate networks. Second, we study the spectral gap as a function of the tie-decay rate and time. Intuitively, we expect small tie-decay rates to lead to fast convergence because the influence of each interaction between two nodes lasts longer for smaller decay rates. Moreover, as time progresses and more interactions occur, we expect eventual convergence. However, we demonstrate that the spectral gap need not decrease monotonically with respect to the decay rate or increase monotonically with respect to time. Our results highlight the importance of the interplay between the times that edges strengthen and decay in temporal networks.
- 28 June 2021
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 3 (2) , 023249
Open AccessOpinion dynamics on tie-decay networks
In social networks, interaction patterns typically change over time. We study opinion dynamics on tie-decay networks in which tie strength increases instantaneously when there is an interaction and decays exponentially between interactions. Specifically, we formulate continuous-time Laplacian dynamics and a discrete-time DeGroot model of opinion dynamics on these tie-decay networks, and we carry out numerical computations for the continuous-time Laplacian dynamics. We examine the speed of convergence by studying the spectral gaps of combinatorial Laplacian matrices of tie-decay networks. First, we compare the spectral gaps of the Laplacian matrices of tie-decay networks that we construct from empirical data with the spectral gaps for corresponding randomized and aggregate networks. We find that the spectral gaps for the empirical networks tend to be smaller than those for the randomized and aggregate networks. Second, we study the spectral gap as a function of the tie-decay rate and time. Intuitively, we expect small tie-decay rates to lead to fast convergence because the influence of each interaction between two nodes lasts longer for smaller decay rates. Moreover, as time progresses and more interactions occur, we expect eventual convergence. However, we demonstrate that the spectral gap need not decrease monotonically with respect to the decay rate or increase monotonically with respect to time. Our results highlight the importance of the interplay between the times that edges strengthen and decay in temporal networks.
- 6 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 8 (2) , 1759-1771
Tie-Decay Networks in Continuous Time and Eigenvector-Based Centralities
Network theory is a useful framework for studying interconnected systems of interacting entities. Many networked systems evolve continuously in time, but most existing methods for the analysis of time-dependent networks rely on discrete or discretized time. In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions, which we model as discrete contacts, and ties, which encode the strengths of relationships over time. To illustrate our tie-decay network formalism, we adapt the well-known PageRank centrality score to our tie-decay framework in a mathematically tractable and computationally efficient way. We apply this framework to a synthetic example and then use it to study a network of retweets during the 2012 National Health Service controversy in the United Kingdom. Our work also provides guidance for similar generalizations of other tools from network theory to continuous-time networks with tie decay, including for applications to streaming data.
- 6 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 8 (2) , 1759-1771
Tie-Decay Networks in Continuous Time and Eigenvector-Based Centralities
Network theory is a useful framework for studying interconnected systems of interacting entities. Many networked systems evolve continuously in time, but most existing methods for the analysis of time-dependent networks rely on discrete or discretized time. In this paper, we propose an approach for studying networks that evolve in continuous time by distinguishing between interactions, which we model as discrete contacts, and ties, which encode the strengths of relationships over time. To illustrate our tie-decay network formalism, we adapt the well-known PageRank centrality score to our tie-decay framework in a mathematically tractable and computationally efficient way. We apply this framework to a synthetic example and then use it to study a network of retweets during the 2012 National Health Service controversy in the United Kingdom. Our work also provides guidance for similar generalizations of other tools from network theory to continuous-time networks with tie decay, including for applications to streaming data.
- Open Access
- 1 February 2021
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 37 (14) , 1982-1989
Robust gene coexpression networks using signed distance correlation
Even within well-studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes/proteins, using a network of gene coexpression data that includes functional annotations. However, the lack of trustworthy functional annotations can impede the validation of such networks. Hence, there is a need for a principled method to construct gene coexpression networks that capture biological information and are structurally stable even in the absence of functional information. We introduce the concept of signed distance correlation as a measure of dependency between two variables, and apply it to generate gene coexpression networks. Distance correlation offers a more intuitive approach to network construction than commonly used methods, such as Pearson correlation and mutual information. We propose a framework to generate self-consistent networks using signed distance correlation purely from gene expression data, with no additional information. We analyse data from three different organisms to illustrate how networks generated with our method are more stable and capture more biological information compared to networks obtained from Pearson correlation or mutual information. Code is available online (https://github.com/javier-pardodiaz/sdcorGCN). Supplementary data are available at Bioinformatics online.
- 1 February 2021
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 37 (14) , 1982-1989
Open AccessRobust gene coexpression networks using signed distance correlation
Even within well-studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes/proteins, using a network of gene coexpression data that includes functional annotations. However, the lack of trustworthy functional annotations can impede the validation of such networks. Hence, there is a need for a principled method to construct gene coexpression networks that capture biological information and are structurally stable even in the absence of functional information. We introduce the concept of signed distance correlation as a measure of dependency between two variables, and apply it to generate gene coexpression networks. Distance correlation offers a more intuitive approach to network construction than commonly used methods, such as Pearson correlation and mutual information. We propose a framework to generate self-consistent networks using signed distance correlation purely from gene expression data, with no additional information. We analyse data from three different organisms to illustrate how networks generated with our method are more stable and capture more biological information compared to networks obtained from Pearson correlation or mutual information. Code is available online (https://github.com/javier-pardodiaz/sdcorGCN). Supplementary data are available at Bioinformatics online.
- Open Access
- 20 January 2021
- Published by The Royal Society in Journal of The Royal Society Interface
- Vol. 18 (174) , 20200898
Occupational mobility and automation: a data-driven network model
The potential impact of automation on the labour market is a topic that has generated significant interest and concern amongst scholars, policymakers and the broader public. A number of studies have estimated occupation-specific risk profiles by examining how suitable associated skills and tasks are for automation. However, little work has sought to take a more holistic view on the process of labour reallocation and how employment prospects are impacted as displaced workers transition into new jobs. In this article, we develop a data-driven model to analyse how workers move through an empirically derived occupational mobility network in response to automation scenarios. At a macro level, our model reproduces the Beveridge curve, a key stylized fact in the labour market. At a micro level, our model provides occupation-specific estimates of changes in short and long-term unemployment corresponding to specific automation shocks. We find that the network structure plays an important role in determining unemployment levels, with occupations in particular areas of the network having few job transition opportunities. In an automation scenario where low wage occupations are more likely to be automated than high wage occupations, the network effects are also more likely to increase the long-term unemployment of low-wage occupations.
- 20 January 2021
- Published by The Royal Society in Journal of The Royal Society Interface
- Vol. 18 (174) , 20200898
Open AccessOccupational mobility and automation: a data-driven network model
The potential impact of automation on the labour market is a topic that has generated significant interest and concern amongst scholars, policymakers and the broader public. A number of studies have estimated occupation-specific risk profiles by examining how suitable associated skills and tasks are for automation. However, little work has sought to take a more holistic view on the process of labour reallocation and how employment prospects are impacted as displaced workers transition into new jobs. In this article, we develop a data-driven model to analyse how workers move through an empirically derived occupational mobility network in response to automation scenarios. At a macro level, our model reproduces the Beveridge curve, a key stylized fact in the labour market. At a micro level, our model provides occupation-specific estimates of changes in short and long-term unemployment corresponding to specific automation shocks. We find that the network structure plays an important role in determining unemployment levels, with occupations in particular areas of the network having few job transition opportunities. In an automation scenario where low wage occupations are more likely to be automated than high wage occupations, the network effects are also more likely to increase the long-term unemployment of low-wage occupations.
- Open Access
Robust gene coexpression networks using signed distance correlation
Motivation: Even within well studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes/proteins, using a network of gene coexpression data that includes functional annotations. However, the lack of trustworthy functional annotations can impede the validation of such networks. Hence, there is a need for a principled method to construct gene coexpression networks that capture biological information and are structurally stable even in the absence of functional information. Results: We introduce the concept of signed distance correlation as a measure of dependency between two variables, and apply it to generate gene coexpression networks. Distance correlation offers a more intuitive approach to network construction than commonly used methods such as Pearson correlation. We propose a framework to generate self-consistent networks using signed distance correlation purely from gene expression data, with no additional information. We analyse data from three different organisms to illustrate how networks generated with our method are more stable and capture more biological information compared to networks obtained from Pearson or Spearman correlations. Code availability: https://github.com/javier-pardodiaz/sdcorGCN .
Open AccessRobust gene coexpression networks using signed distance correlation
Motivation: Even within well studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes/proteins, using a network of gene coexpression data that includes functional annotations. However, the lack of trustworthy functional annotations can impede the validation of such networks. Hence, there is a need for a principled method to construct gene coexpression networks that capture biological information and are structurally stable even in the absence of functional information. Results: We introduce the concept of signed distance correlation as a measure of dependency between two variables, and apply it to generate gene coexpression networks. Distance correlation offers a more intuitive approach to network construction than commonly used methods such as Pearson correlation. We propose a framework to generate self-consistent networks using signed distance correlation purely from gene expression data, with no additional information. We analyse data from three different organisms to illustrate how networks generated with our method are more stable and capture more biological information compared to networks obtained from Pearson or Spearman correlations. Code availability: https://github.com/javier-pardodiaz/sdcorGCN .
- Open Access
Tensor clustering with algebraic constraints gives interpretable groups of crosstalk mechanisms in breast cancer
We introduce a tensor-based clustering method to extract sparse, low-dimensional structure from high-dimensional, multi-indexed datasets. This framework is designed to enable detection of clusters of data in the presence of structural requirements which we encode as algebraic constraints in a linear program. Our clustering method is general and can be tailored to a variety of applications in science and industry. We illustrate our method on a collection of experiments measuring the response of genetically diverse breast cancer cell lines to an array of ligands. Each experiment consists of a cell line-ligand combination, and contains time-course measurements of the early-signalling kinases MAPK and AKT at two different ligand dose levels. By imposing appropriate structural constraints and respecting the multi-indexed structure of the data, the analysis of clusters can be optimized for biological interpretation and therapeutic understanding. We then perform a systematic, large-scale exploration of mechanistic models of MAPK-AKT crosstalk for each cluster. This analysis allows us to quantify the heterogeneity of breast cancer cell subtypes, and leads to hypotheses about the signalling mechanisms that mediate the response of the cell lines to ligands.
Open AccessTensor clustering with algebraic constraints gives interpretable groups of crosstalk mechanisms in breast cancer
We introduce a tensor-based clustering method to extract sparse, low-dimensional structure from high-dimensional, multi-indexed datasets. This framework is designed to enable detection of clusters of data in the presence of structural requirements which we encode as algebraic constraints in a linear program. Our clustering method is general and can be tailored to a variety of applications in science and industry. We illustrate our method on a collection of experiments measuring the response of genetically diverse breast cancer cell lines to an array of ligands. Each experiment consists of a cell line-ligand combination, and contains time-course measurements of the early-signalling kinases MAPK and AKT at two different ligand dose levels. By imposing appropriate structural constraints and respecting the multi-indexed structure of the data, the analysis of clusters can be optimized for biological interpretation and therapeutic understanding. We then perform a systematic, large-scale exploration of mechanistic models of MAPK-AKT crosstalk for each cluster. This analysis allows us to quantify the heterogeneity of breast cancer cell subtypes, and leads to hypotheses about the signalling mechanisms that mediate the response of the cell lines to ligands.