no code implementations • 10 Apr 2024 • Shreyas Chaudhari, Srinivasa Pranav, José M. F. Moura
Our analysis leads to two distinct GradNet architectures, GradNet-C and GradNet-M, and we describe the corresponding monotone versions, mGradNet-C and mGradNet-M. Our empirical results show that these architectures offer efficient parameterizations and outperform popular methods in gradient field learning tasks.
1 code implementation • 24 Mar 2024 • Oren Wright, Yorie Nakahira, José M. F. Moura
Uncertainty quantification of neural networks is critical to measuring the reliability and robustness of deep learning systems.
no code implementations • 21 Dec 2023 • Srinivasa Pranav, José M. F. Moura
Peer-to-peer deep learning algorithms are enabling distributed edge devices to collaboratively train deep neural networks without exchanging raw training data or relying on a central server.
no code implementations • 18 Dec 2023 • Augusto Santos, Diogo Rente, Rui Seabra, José M. F. Moura
In a Networked Dynamical System (NDS), each node is a system whose dynamics are coupled with the dynamics of neighboring nodes.
1 code implementation • 10 Dec 2023 • Augusto Santos, Diogo Rente, Rui Seabra, José M. F. Moura
To address the challenge of noise correlation and partial observability, we assign to each pair of nodes a feature vector computed from the time series data of observed nodes.
no code implementations • 29 Oct 2023 • Srinivasa Pranav, José M. F. Moura
We present P2PL, a practical multi-device peer-to-peer deep learning algorithm that, unlike the federated learning paradigm, does not require coordination from edge servers or the cloud.
no code implementations • 21 Mar 2023 • Geert Leus, Antonio G. Marques, José M. F. Moura, Antonio Ortega, David I Shuman
Graph signal processing (GSP) generalizes signal processing (SP) tasks to signals living on non-Euclidean domains whose structure can be captured by a weighted graph.
no code implementations • 25 Jan 2023 • Shreyas Chaudhari, Srinivasa Pranav, José M. F. Moura
While much effort has been devoted to deriving and analyzing effective convex formulations of signal processing problems, the gradients of convex functions also have critical applications ranging from gradient-based optimization to optimal transport.
no code implementations • 25 Oct 2022 • Stefan Vlaski, Soummya Kar, Ali H. Sayed, José M. F. Moura
Moreover, and significantly, theory and applications show that networked agents, through cooperation and sharing, are able to match the performance of cloud or federated solutions, while offering the potential for improved privacy, increasing resilience, and saving resources.
1 code implementation • 8 Aug 2022 • Sérgio Machado, Anirudh Sridhar, Paulo Gil, Jorge Henriques, José M. F. Moura, Augusto Santos
This renders the features amenable to train a variety of classifiers to perform causal inference.
no code implementations • 13 Apr 2021 • Yang Li, Di Wang, José M. F. Moura
This task is challenging as models need not only to capture spatial dependency and temporal dependency within the data, but also to leverage useful auxiliary information for accurate predictions.
no code implementations • 18 Feb 2021 • Shreyas Chaudhari, Harideep Nair, José M. F. Moura, John Paul Shen
Unsupervised time series clustering is a challenging problem with diverse industrial applications such as anomaly detection, bio-wearables, etc.
no code implementations • 16 Dec 2020 • Lavender Yao Jiang, John Shi, Mark Cheung, Oren Wright, José M. F. Moura
Graph neural networks (GNNs) extend convolutional neural networks (CNNs) to graph-based data.
no code implementations • 30 Nov 2020 • Yixiong Zou, Shanghang Zhang, Guangyao Chen, Yonghong Tian, Kurt Keutzer, José M. F. Moura
In this paper, we target a new problem, Annotation-Efficient Video Recognition, to reduce the requirement of annotations for both large amount of samples and the action location.
no code implementations • 7 Aug 2020 • Yixiong Zou, Shanghang Zhang, JianPeng Yu, Yonghong Tian, José M. F. Moura
To solve this problem, cross-domain FSL (CDFSL) is proposed very recently to transfer knowledge from general-domain base classes to special-domain novel classes.
no code implementations • 4 Aug 2020 • Mark Cheung, John Shi, Oren Wright, Lavender Y. Jiang, Xujin Liu, José M. F. Moura
Deep learning, particularly convolutional neural networks (CNNs), have yielded rapid, significant improvements in computer vision and related domains.
no code implementations • 12 May 2020 • Yixiong Zou, Shanghang Zhang, Ke Chen, Yonghong Tian, Yao-Wei Wang, José M. F. Moura
Inspired by such capability of humans, to imitate humans' ability of learning visual primitives and composing primitives to recognize novel classes, we propose an approach to FSL to learn a feature representation composed of important primitives, which is jointly trained with two parts, i. e. primitive discovery and primitive enhancing.
no code implementations • 1 May 2020 • Umang Bhatt, Adrian Weller, José M. F. Moura
A feature-based model explanation denotes how much each input feature contributes to a model's output for a given data point.
no code implementations • 7 Apr 2020 • Mark Cheung, John Shi, Lavender Yao Jiang, Oren Wright, José M. F. Moura
Graph convolutional neural networks (GCNNs) are a powerful extension of deep learning techniques to graph-structured data problems.
no code implementations • 23 Mar 2020 • Brian Swenson, Soummya Kar, H. Vincent Poor, José M. F. Moura, Aaron Jaech
We discuss local minima convergence guarantees and explore the simple but critical role of the stable-manifold theorem in analyzing saddle-point avoidance.
Optimization and Control
no code implementations • 14 Jan 2020 • João Domingos, José M. F. Moura
The (right) eigenvectors of the shift $A$ (graph spectral components) diagonalize $A$ and lead to a graph Fourier basis $F$ that provides a graph spectral representation of the graph signal.
no code implementations • 13 Sep 2019 • Umang Bhatt, Alice Xiang, Shubham Sharma, Adrian Weller, Ankur Taly, Yunhan Jia, Joydeep Ghosh, Ruchir Puri, José M. F. Moura, Peter Eckersley
Yet there is little understanding of how organizations use these methods in practice.
no code implementations • 9 Sep 2019 • Yang Li, José M. F. Moura
Specifically, we start by learning the structure of the graph that parsimoniously represents the spatial dependency between the data at different locations.
1 code implementation • NAACL 2019 • Satwik Kottur, José M. F. Moura, Devi Parikh, Dhruv Batra, Marcus Rohrbach
Specifically, we construct a dialog grammar that is grounded in the scene graphs of the images from the CLEVR dataset.
no code implementations • 20 Jan 2019 • Brian Davis, Umang Bhatt, Kartikeya Bhardwaj, Radu Marculescu, José M. F. Moura
In this paper, we present a new approach to interpret deep learning models.
no code implementations • NeurIPS 2018 • Han Zhao, Shanghang Zhang, Guanhang Wu, José M. F. Moura, Joao P. Costeira, Geoffrey J. Gordon
In this paper we propose new generalization bounds and algorithms under both classification and regression settings for unsupervised multiple source domain adaptation.
Ranked #3 on Domain Adaptation on GTA5+Synscapes to Cityscapes
1 code implementation • ECCV 2018 • Satwik Kottur, José M. F. Moura, Devi Parikh, Dhruv Batra, Marcus Rohrbach
Visual dialog entails answering a series of questions grounded in an image, using dialog history as context.
Ranked #1 on Common Sense Reasoning on Visual Dialog v0.9
no code implementations • 28 Jun 2018 • Jonathan Mei, José M. F. Moura
A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure.
no code implementations • 5 Jun 2018 • Jonathan Mei, José M. F. Moura
Algorithms for learning the time series of graphs $\left\{G_k\right\}$, deriving the eigennetworks, eigenfeatures and eigentrajectories, and detecting changepoints are presented.
2 code implementations • 1 Dec 2017 • Antonio Ortega, Pascal Frossard, Jelena Kovačević, José M. F. Moura, Pierre Vandergheynst
Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains.
Signal Processing
1 code implementation • ICCV 2017 • Shanghang Zhang, Guanhang Wu, João P. Costeira, José M. F. Moura
To overcome limitations of existing methods and incorporate the temporal information of traffic video, we design a novel FCN-rLSTM network to jointly estimate vehicle density and vehicle count by connecting fully convolutional neural networks (FCN) with long short term memory networks (LSTM) in a residual learning fashion.
3 code implementations • 26 Jun 2017 • Satwik Kottur, José M. F. Moura, Stefan Lee, Dhruv Batra
A number of recent works have proposed techniques for end-to-end learning of communication protocols among cooperative multi-agent populations, and have simultaneously found the emergence of grounded human-interpretable language in the protocols developed by the agents, all learned without any human supervision!
no code implementations • 12 Jun 2017 • Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, José M. F. Moura
Gaussian belief propagation (BP) has been widely used for distributed inference in large-scale networks such as the smart grid, sensor networks, and social networks, where local measurements/observations are scattered over a wide geographical area.
4 code implementations • 26 May 2017 • Han Zhao, Shanghang Zhang, Guanhang Wu, João P. Costeira, José M. F. Moura, Geoffrey J. Gordon
As a step toward bridging the gap, we propose a new generalization bound for domain adaptation when there are multiple source domains with labeled instances and one target domain with unlabeled instances.
no code implementations • 13 Apr 2017 • Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, José M. F. Moura
Gaussian belief propagation (BP) has been widely used for distributed estimation in large-scale networks such as the smart grid, communication networks, and social networks, where local measurements/observations are scattered over a wide geographical area.
7 code implementations • ICCV 2017 • Abhishek Das, Satwik Kottur, José M. F. Moura, Stefan Lee, Dhruv Batra
Specifically, we pose a cooperative 'image guessing' game between two agents -- Qbot and Abot -- who communicate in natural language dialog so that Qbot can select an unseen image from a lineup of images.
1 code implementation • CVPR 2017 • Shanghang Zhang, Guanhang Wu, João P. Costeira, José M. F. Moura
Understanding traffic density from large-scale web camera (webcam) videos is a challenging problem because such videos have low spatial and temporal resolution, high occlusion and large perspective.
11 code implementations • CVPR 2017 • Abhishek Das, Satwik Kottur, Khushi Gupta, Avi Singh, Deshraj Yadav, José M. F. Moura, Devi Parikh, Dhruv Batra
We introduce the task of Visual Dialog, which requires an AI agent to hold a meaningful dialog with humans in natural, conversational language about visual content.
Ranked #15 on Visual Dialog on VisDial v0.9 val
no code implementations • 7 Nov 2016 • Jian Du, Shaodan Ma, Yik-Chung Wu, Soummya Kar, José M. F. Moura
A necessary and sufficient convergence condition for the belief mean vector to converge to the optimal centralized estimator is provided under the assumption that the message information matrix is initialized as a positive semidefinite matrix.
1 code implementation • CVPR 2016 • Satwik Kottur, Ramakrishna Vedantam, José M. F. Moura, Devi Parikh
While word embeddings trained using text have been extremely successful, they cannot uncover notions of semantic relatedness implicit in our visual world.
no code implementations • 28 Feb 2015 • Jonathan Mei, José M. F. Moura
Many applications collect a large number of time series, for example, the financial data of companies quoted in a stock exchange, the health care data of all patients that visit the emergency room of a hospital, or the temperature sequences continuously measured by weather stations across the US.
no code implementations • 26 Nov 2014 • Siheng Chen, Aliaksei Sandryhaila, José M. F. Moura, Jelena Kovačević
We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph.