Publications

Beyond Gaussian Noise: A Generalized Approach to Likelihood Analysis with non-Gaussian Noise
Ronan Legin
Alexandre Adam
Yashar Hezaveh
Laurence Perreault Levasseur
Likelihood analysis is typically limited to normally distributed noise due to the difficulty of determining the probability density function… (see more) of complex, high-dimensional, non-Gaussian, and anisotropic noise. This is a major limitation for precision measurements in many domains of science, including astrophysics, for example, for the analysis of the Cosmic Microwave Background, gravitational waves, gravitational lensing, and exoplanets. This work presents Score-based LIkelihood Characterization (SLIC), a framework that resolves this issue by building a data-driven noise model using a set of noise realizations from observations. We show that the approach produces unbiased and precise likelihoods even in the presence of highly non-Gaussian correlated and spatially varying noise. We use diffusion generative models to estimate the gradient of the probability density of noise with respect to data elements. In combination with the Jacobian of the physical model of the signal, we use Langevin sampling to produce independent samples from the unbiased likelihood. We demonstrate the effectiveness of the method using real data from the Hubble Space Telescope and James Webb Space Telescope.
2023-05-31
The Astrophysical Journal Letters (published)
doi.org
arxiv.org
Communication Load Balancing via Efficient Inverse Reinforcement Learning
Abhisek Konar
Di Wu
Yi Tian Xu
Seowoo Jang
Steve Liu
Gregory Dudek
Communication load balancing aims to balance the load between different available resources, and thus improve the quality of service for net… (see more)work systems. After formulating the load balancing (LB) as a Markov decision process problem, reinforcement learning (RL) has recently proven effective in addressing the LB problem. To leverage the benefits of classical RL for load balancing, however, we need an explicit reward definition. Engineering this reward function is challenging, because it involves the need for expert knowledge and there lacks a general consensus on the form of an optimal reward function. In this work, we tackle the communication load balancing problem from an inverse reinforcement learning (IRL) approach. To the best of our knowledge, this is the first time IRL has been successfully applied in the field of communication load balancing. Specifically, first, we infer a reward function from a set of demonstrations, and then learn a reinforcement learning load balancing policy with the inferred reward function. Compared to classical RL-based solution, the proposed solution can be more general and more suitable for real-world scenarios. Experimental evaluations implemented on different simulated traffic scenarios have shown our method to be effective and better than other baselines by a considerable margin.
2023-05-31
ICC 2023 - IEEE International Conference on Communications (published)
doi.org
arxiv.org
Discussion of “Experimental Study of the Thixotropic Strength Recovery and Microstructural Evolution of Marine Clays”
Xianwei Zhang
Xinyu Liu
Gang Wang
2023-05-31
Journal of Geotechnical and Geoenvironmental Engineering (published)
doi.org
Fast Fine-Tuning Using Curriculum Domain Adaptation
Lulan Shen
Ibtihel Amara
Ruofeng Li
Brett Meyer
Warren Gross
James J. Clark
Current deep neural networks (DNNs) have achieved remarkable accuracy in various downstream tasks. However, their training and fine-tuning a… (see more)re challenging due to several factors, such as limited computational resources, extended training and fine-tuning times, and over-fitting due to small datasets. To address these challenges, we propose a three-stage fast fine-tuning method that efficiently trains DNNs for edge devices. Our method combines curriculum learning and domain adaptation techniques to accelerate training while achieving comparable performance. First, we develop a data curriculum approach, which ranks the dataset according to difficulty and split it into the source domain (containing easy data) and the target domain (containing difficult data). Second, we adapt the pretrained model from the source domain to the target domain using an unsupervised domain adaptation (UDA) method called Deep CORAL. Finally, we continue training the adapted model on the source domain with fewer epochs. Our method achieves high accuracy quickly on various modern neural network architectures and datasets such as CIFAR-10, CIFAR-100, and CINIC-10.
2023-05-31
Canadian Conference on Computer and Robot Vision (published)
doi.org
Geometry Regularized Autoencoders
Andres F. Duque Correa
Sacha Morin
Guy Wolf
Kevin R. Moon
A fundamental task in data exploration is to extract low dimensional representations that capture intrinsic geometry in data, especially for… (see more) faithfully visualizing data in two or three dimensions. Common approaches use kernel methods for manifold learning. However, these methods typically only provide an embedding of the input data and cannot extend naturally to new data points. Autoencoders have also become popular for representation learning. While they naturally compute feature extractors that are extendable to new data and invertible (i.e., reconstructing original features from latent representation), they often fail at representing the intrinsic data geometry compared to kernel-based manifold learning. We present a new method for integrating both approaches by incorporating a geometric regularization term in the bottleneck of the autoencoder. This regularization encourages the learned latent representation to follow the intrinsic data geometry, similar to manifold learning algorithms, while still enabling faithful extension to new data and preserving invertibility. We compare our approach to autoencoder models for manifold learning to provide qualitative and quantitative evidence of our advantages in preserving intrinsic structure, out of sample extension, and reconstruction. Our method is easily implemented for big-data applications, whereas other methods are limited in this regard.
2023-05-31
IEEE Transactions on Pattern Analysis and Machine Intelligence (published)
doi.org
Grow-push-prune: Aligning deep discriminants for effective structural network compression
Qing Tian
Tal Arbel
James J. Clark
2023-05-31
Computer Vision and Image Understanding (published)
doi.org
arxiv.org
HSV-2 triggers upregulation of MALAT1 in CD4+ T cells and promotes HIV latency reversal
Carl A. Pierce
Lip Nam Loh
Holly Steach
Natalia Cheshenko
Paula Preston-Hurlburt
Fengrui Zhang
Stephanie Stransky
Leah Kravets
Simone Sidoli
William Philbrick
Michel Nassar
Smita Krishnaswamy
Kevan C. Herold
Betsy C. Herold
Herpes simplex virus type 2 (HSV-2) coinfection is associated with increased HIV-1 viral loads and expanded tissue reservoirs, but the mecha… (see more)nisms are not well defined. HSV-2 recurrences result in an influx of activated CD4+ T cells to sites of viral replication and an increase in activated CD4+ T cells in peripheral blood. We hypothesized that HSV-2 induces changes in these cells that facilitate HIV-1 reactivation and replication and tested this hypothesis in human CD4+ T cells and 2D10 cells, a model of HIV-1 latency. HSV-2 promoted latency reversal in HSV-2–infected and bystander 2D10 cells. Bulk and single-cell RNA-Seq studies of activated primary human CD4+ T cells identified decreased expression of HIV-1 restriction factors and increased expression of transcripts including MALAT1 that could drive HIV replication in both the HSV-2–infected and bystander cells. Transfection of 2D10 cells with VP16, an HSV-2 protein that regulates transcription, significantly upregulated MALAT1 expression, decreased trimethylation of lysine 27 on histone H3 protein, and triggered HIV latency reversal. Knockout of MALAT1 from 2D10 cells abrogated the response to VP16 and reduced the response to HSV-2 infection. These results demonstrate that HSV-2 contributes to HIV-1 reactivation through diverse mechanisms, including upregulation of MALAT1 to release epigenetic silencing.
2023-05-31
The Journal of Clinical Investigation (published)
doi.org
Mixed-Variable PSO with Fairness on Multi-Objective Field Data Replication in Wireless Networks
Dun Yuan
Yujin Nam
Amal Feriani
Abhisek Konar
Di Wu
Seowoo Jang
Xue Liu
Gregory Dudek
Digital twins have shown a great potential in supporting the development of wireless networks. They are virtual representations of 5G/6G sys… (see more)tems enabling the design of machine learning and optimization-based techniques. Field data replication is one of the critical aspects of building a simulation-based twin, where the objective is to calibrate the simulation to match field performance measurements. Since wireless networks involve a variety of key performance indicators (KPIs), the replication process becomes a multi-objective optimization problem in which the purpose is to minimize the error between the simulated and field data KPIs. Unlike previous works, we focus on designing a data-driven search method to calibrate the simulator and achieve accurate and reliable reproduction of field performance. This work proposes a search-based algorithm based on mixed-variable particle swarm optimization (PSO) to find the optimal simulation parameters. Furthermore, we extend this solution to account for potential conflicts between the KPIs using a-fairness concept to adjust the importance attributed to each KPI during the search. Experiments on field data showcase the effectiveness of our approach to (i) improve the accuracy of the replication, (ii) enhance the fairness between the different KPIs, and (iii) guarantee faster convergence compared to other methods.
2023-05-31
ICC 2023 - IEEE International Conference on Communications (published)
doi.org
arxiv.org
Multi-Agent Attention Actor-Critic Algorithm for Load Balancing in Cellular Networks
Jikun Kang
Di Wu
Ju Wang
Ekram Hossain
Xue Liu
Gregory Dudek
In cellular networks, User Equipment (UE) handoff from one Base Station (BS) to another, giving rise to the load balancing problem among the… (see more) BSs. To address this problem, BSs can work collaboratively to deliver a smooth migration (or handoff) and satisfy the UEs' service requirements. This paper formulates the load balancing problem as a Markov game and proposes a Robust Multi-agent Attention Actor-Critic (Robust-MA3C) algorithm that can facilitate collaboration among the BSs (i.e., agents). In particular, to solve the Markov game and find a Nash equilibrium policy, we embrace the idea of adopting a nature agent to model the system uncertainty. Moreover, we utilize the self-attention mechanism, which encourages high-performance BSs to assist low-performance BSs. In addition, we consider two types of schemes, which can facilitate load balancing for both active UEs and idle UEs. We carry out extensive evaluations by simulations, and simulation results illustrate that, compared to the state-of-the-art MARL methods, Robust-MA3C scheme can improve the overall performance by up to 45%.
2023-05-31
ICC 2023 - IEEE International Conference on Communications (published)
doi.org
arxiv.org
Policy Reuse for Communication Load Balancing in Unseen Traffic Scenarios
Yi Tian Xu
Jimmy Li
Di Wu
M. Jenkin
Seowoo Jang
Xue Liu
Gregory Dudek
With the continuous growth in communication network complexity and traffic volume, communication load balancing solutions are receiving incr… (see more)easing attention. Specifically, reinforcement learning (RL)-based methods have shown impressive performance compared with traditional rule-based methods. However, standard RL methods generally require an enormous amount of data to train, and generalize poorly to scenarios that are not encountered during training. We propose a policy reuse framework in which a policy selector chooses the most suitable pre-trained RL policy to execute based on the current traffic condition. Our method hinges on a policy bank composed of policies trained on a diverse set of traffic scenarios. When deploying to an unknown traffic scenario, we select a policy from the policy bank based on the similarity between the previous-day traffic of the current scenario and the traffic observed during training. Experiments demonstrate that this framework can outperform classical and adaptive rule-based methods by a large margin.
2023-05-31
ICC 2023 - IEEE International Conference on Communications (published)
doi.org
arxiv.org
Robust Scuba Diver Tracking and Recovery in Open Water Using YOLOv7, SORT, and Spiral Search
Faraz Lotfi
Khalil Virji
Gregory Dudek
Target tracking is a classic problem in computer vision, with numerous applications in robotics. However, tracking targets underwater presen… (see more)ts additional complications due to the six degrees of freedom nature of the problem and the challenging visual environment. In this paper, we address the problem of robotic underwater tracking of scuba divers by partitioning it into two parts: vision and control. We propose a new approach that exploits a highly-maneuverable underwater robot to perform experiments in open water, coupling sensing and control for improved performance. To evaluate the temporal stability of different tracking paradigms, we introduce a new metric, frame-to-frame vari-ance, which is better suited to assess the smoothness of detections from the vision side. We implement PID controllers for control and a spiral search algorithm for target recovery in case of a tracking failure. Our approach only uses observations in the image plane, eliminating the need for robot localization or camera calibration. Using a tracking-by-detection paradigm that combines YOLOv7 for target detection, a tuned filtering technique for temporal stability, and a spiral search algorithm for target recovery, we demonstrate promising performance for long-term tracking. We evaluate our proposed paradigm on the VDD-C dataset and deploy it on an underwater robot for several experiments in open water. Our outcomes show consistency with the ones in the initial studies, and the spiral search algorithm demonstrates promising performance for recapturing a target after a tracking failure. Our approach delivers promising performance for robust underwater tracking, achieving successful open-water tracking scenarios in the presence of strong water currents.
2023-05-31
Canadian Conference on Computer and Robot Vision (published)
doi.org
Self-Supervised Transformer Architecture for Change Detection in Radio Access Networks
Igor Kozlov
Dmitriy Rivkin
Wei-Di Chang
Di Wu
Xue Liu
Gregory Dudek
Radio Access Networks (RANs) for telecommunications represent large agglomerations of interconnected hardware consisting of hundreds of thou… (see more)sands of transmitting devices (cells). Such networks undergo frequent and often heterogeneous changes caused by network operators, who are seeking to tune their system parameters for optimal performance. The effects of such changes are challenging to predict and will become even more so with the adoption of fifth-generation/sixth-generation (5G/6G) networks. Therefore, RAN monitoring is vital for network operators. We propose a self-supervised learning framework that leverages self-attention and self-distillation for this task. It works by detecting changes in Performance Measurement data, a collection of time-varying metrics which reflect a set of diverse measurements of the network performance at the cell level. Experimental results show that our approach outperforms the state of the art by 4% on a real-world based dataset consisting of about hundred thousands time series. It also has the merits of being scalable and generalizable. This allows it to provide deep insight into the specifics of mode of operation changes while relying minimally on expert knowledge.
2023-05-31
ICC 2023 - IEEE International Conference on Communications (published)
doi.org
arxiv.org