pwc-archive/papers-with-abstracts huggingface dataset:
Towards Latent Masked Image Modeling for Self-Supervised Visual Representation Learning
Authors: Yibing Wei, Abhinav Gupta, Pedro Morgado
Date: 2024-07-22 00:00:00
Tasks: Representation Learning

Masked Image Modeling (MIM) has emerged as a promising method for deriving visual representations from unlabeled image data by predicting missing pixels from masked portions of images. It excels in region-aware learning and provides strong initializations for various tasks, but struggles to capture high-level semantics without further supervised fine-tuning, likely due to the low-level nature of its pixel reconstruction objective. A promising yet unrealized framework is learning representations through masked reconstruction in latent space, combining the locality of MIM with the high-level targets. However, this approach poses significant training challenges as the reconstruction targets are learned in conjunction with the model, potentially leading to trivial or suboptimal solutions.Our study is among the first to thoroughly analyze and address the challenges of such framework, which we refer to as Latent MIM. Through a series of carefully designed experiments and extensive analysis, we identify the source of these challenges, including representation collapsing for joint online/target optimization, learning objectives, the high region correlation in latent space and decoding conditioning. By sequentially addressing these issues, we demonstrate that Latent MIM can indeed learn high-level representations while retaining the benefits of MIM models.
NV-Retriever: Improving text embedding models with effective hard-negative mining
Authors: Gabriel de Souza P. Moreira, Radek Osmulski, Mengyao Xu, Ronay Ak, Benedikt Schifferer, Even Oldridge
Date: 2024-07-22 00:00:00
Tasks: Contrastive Learning, Information Retrieval, Question Answering, RAG, Retrieval, Retrieval-augmented Generation

Text embedding models have been popular for information retrieval applications such as semantic search and Question-Answering systems based on Retrieval-Augmented Generation (RAG). Those models are typically Transformer models that are fine-tuned with contrastive learning objectives. Many papers introduced new embedding model architectures and training approaches, however, one of the key ingredients, the process of mining negative passages, remains poorly explored or described. One of the challenging aspects of fine-tuning embedding models is the selection of high quality hard-negative passages for contrastive learning. In this paper we propose a family of positive-aware mining methods that leverage the positive relevance score for more effective false negatives removal. We also provide a comprehensive ablation study on hard-negative mining methods over their configurations, exploring different teacher and base models. We demonstrate the efficacy of our proposed methods by introducing the NV-Retriever-v1 model, which scores 60.9 on MTEB Retrieval (BEIR) benchmark and 0.65 points higher than previous methods. The model placed 1st when it was published to MTEB Retrieval on July 07, 2024.
On shallow planning under partial observability
Authors: Randy Lefebvre, Audrey Durand
Date: 2024-07-22 00:00:00
Tasks: reinforcement-learning, Reinforcement Learning

Formulating a real-world problem under the Reinforcement Learning framework involves non-trivial design choices, such as selecting a discount factor for the learning objective (discounted cumulative rewards), which articulates the planning horizon of the agent. This work investigates the impact of the discount factor on the biasvariance trade-off given structural parameters of the underlying Markov Decision Process. Our results support the idea that a shorter planning horizon might be beneficial, especially under partial observability.
Perceptions of Linguistic Uncertainty by Language Models and Humans
Authors: Catarina G Belem, Markelle Kelly, Mark Steyvers, Sameer Singh, Padhraic Smyth
Date: 2024-07-22 00:00:00

_Uncertainty expressions_ such as "probably" or "highly unlikely" are pervasive in human language. While prior work has established that there is population-level agreement in terms of how humans quantitatively interpret these expressions, there has been little inquiry into the abilities of language models in the same context. In this paper, we investigate how language models map linguistic expressions of uncertainty to numerical responses. Our approach assesses whether language models can employ theory of mind in this setting: understanding the uncertainty of another agent about a particular statement, independently of the model's own certainty about that statement. We find that 7 out of 10 models are able to map uncertainty expressions to probabilistic responses in a human-like manner. However, we observe systematically different behavior depending on whether a statement is actually true or false. This sensitivity indicates that language models are substantially more susceptible to bias based on their prior knowledge (as compared to humans). These findings raise important questions and have broad implications for human-AI and AI-AI communication.
Stretching Each Dollar: Diffusion Training from Scratch on a Micro-Budget
Authors: Vikash Sehwag, Xianghao Kong, Jingtao Li, Michael Spranger, Lingjuan Lyu
Date: 2024-07-22 00:00:00
Proceeding: CVPR 2025 1
Tasks: Mixture-of-Experts

As scaling laws in generative AI push performance, they also simultaneously concentrate the development of these models among actors with large computational resources. With a focus on text-to-image (T2I) generative models, we aim to address this bottleneck by demonstrating very low-cost training of large-scale T2I diffusion transformer models. As the computational cost of transformers increases with the number of patches in each image, we propose to randomly mask up to 75% of the image patches during training. We propose a deferred masking strategy that preprocesses all patches using a patch-mixer before masking, thus significantly reducing the performance degradation with masking, making it superior to model downscaling in reducing computational cost. We also incorporate the latest improvements in transformer architecture, such as the use of mixture-of-experts layers, to improve performance and further identify the critical benefit of using synthetic images in micro-budget training. Finally, using only 37M publicly available real and synthetic images, we train a 1.16 billion parameter sparse transformer with only \$1,890 economical cost and achieve a 12.7 FID in zero-shot generation on the COCO dataset. Notably, our model achieves competitive FID and high-quality generations while incurring 118$\times$ lower cost than stable diffusion models and 14$\times$ lower cost than the current state-of-the-art approach that costs \$28,400. We aim to release our end-to-end training pipeline to further democratize the training of large-scale diffusion models on micro-budgets.
Multi-Objective Distributed Beamforming Using High-Accuracy Synchronization and Localization
Authors: Ahona Bhattacharyya, Jeffrey A. Nanzer
Date: 2024-07-22 00:00:00

We present a multi-node, multi-objective open-loop microwave distributed beamforming system based on high-accuracy wireless synchronization and localization. Distributed beamforming requires accurate coordination of the spatial and electrical states of the individual elements within the array to achieve and maintain coherent beamforming at intended destinations. Of the basic coordination aspects, time synchronization and localization of the elements are among the most critical to support beamforming of modulated waveforms to destinations in both the near-field and far-field of the array. In this work, we demonstrate multi-objective distributed beamforming from a three-node distributed phased array consisting of software-defined radios that leverages high-accuracy wireless time coordination for both time synchronization and two-dimensional localization of the elements. We use a spectrally-sparse two-tone waveform for high-accuracy inter-node range estimation combined with a linear-frequency modulated waveform to mitigate multipath interference. Localization is performed in a centralized format, where one node is designated as the origin and the remaining nodes build the array geometry relative to the origin, from which we obtain localization accuracy of less than 1 cm. We implement a near-field multi-objective beamformer based on the location estimates, which enables the simultaneous steering of a beam and a null to two receiving antennas. Multi-objective beamforming of pulsed waveforms at a carrier frequency of 2.1 GHz is demonstrated in cases where one of the nodes in the distributed antenna array is moved, and where the targets (the two receiving antennas) are moved.
CLIP with Generative Latent Replay: a Strong Baseline for Incremental Learning
Authors: Emanuele Frascaroli, Aniello Panariello, Pietro Buzzega, Lorenzo Bonicelli, Angelo Porrello, Simone Calderara
Date: 2024-07-22 00:00:00
Tasks: Class Incremental Learning, Continual Learning, Incremental Learning, Prompt Learning

With the emergence of Transformers and Vision-Language Models (VLMs) such as CLIP, fine-tuning large pre-trained models has recently become a prevalent strategy in Continual Learning. This has led to the development of numerous prompting strategies to adapt transformer-based models without incurring catastrophic forgetting. However, these strategies often compromise the original zero-shot capabilities of the pre-trained CLIP model and struggle to adapt to domains that significantly deviate from the pre-training data. In this work, we propose Continual Generative training for Incremental prompt-Learning, a simple and novel approach to mitigate forgetting while adapting CLIP. Briefly, we employ Variational Autoencoders (VAEs) to learn class-conditioned distributions within the embedding space of the visual encoder. We then exploit these distributions to sample new synthetic visual embeddings and train the corresponding class-specific textual prompts during subsequent tasks. Through extensive experiments on different domains, we show that such a generative replay approach can adapt to new tasks while improving zero-shot capabilities, evaluated using a novel metric tailored for CL scenarios. Notably, further analysis reveals that our approach can bridge the gap with joint prompt tuning. The codebase is available at https://github.com/aimagelab/mammoth.
Mobile-to-Mobile Uncorrelated Scatter Channels
Authors: Michael Walter, Martin Schmidhammer, Miguel A. Bellido-Manganell, Thomas Wiedemann, Dmitriy Shutin
Date: 2024-07-22 00:00:00

In this paper, we present a complete analytic probability based description of mobile-to-mobile uncorrelated scatter channels. The correlation based description introduced by Bello and Matz is thus complemented by the presented probabilistic description leading to a common theoretical description of uncorrelated scatter channels. Furthermore, we introduce novel twodimensional hybrid characteristic probability density functions, which remain a probability density in one of the variables and a characteristic function in the other variable. Such a probability based description allows us to derive a mathematical model, in which the attenuation of the scattering components is inherently included in these two-dimensional functions. Therefore, there is no need to determine the path loss exponent. Additionally, the Doppler probability density function with the inclusion of the path loss leads to a concave function of the Doppler spectrum, which is quite different from the Jakes and Doppler spectra and can be directly parameterized by the velocity vectors and geometry of the scattering plane. Thus, knowing those parameters permits the theoretical computation of the Doppler spectra and temporal characteristic functions. Finally, we present a comparison between the computed probability based theoretical results and measurement data for a generic mobile-to-mobile channel. The agreement between the two shows the usefulness of the probability based description and confirms new shapes of the Doppler power spectra.
Concept-Based Interpretable Reinforcement Learning with Limited to No Human Labels
Authors: Zhuorui Ye, Stephanie Milani, Geoffrey J. Gordon, Fei Fang
Date: 2024-07-22 00:00:00
Tasks: Decision Making, Reinforcement Learning (RL)

Recent advances in reinforcement learning (RL) have predominantly leveraged neural network-based policies for decision-making, yet these models often lack interpretability, posing challenges for stakeholder comprehension and trust. Concept bottleneck models offer an interpretable alternative by integrating human-understandable concepts into neural networks. However, a significant limitation in prior work is the assumption that human annotations for these concepts are readily available during training, necessitating continuous real-time input from human annotators. To overcome this limitation, we introduce a novel training scheme that enables RL algorithms to efficiently learn a concept-based policy by only querying humans to label a small set of data, or in the extreme case, without any human labels. Our algorithm, LICORICE, involves three main contributions: interleaving concept learning and RL training, using a concept ensembles to actively select informative data points for labeling, and decorrelating the concept data with a simple strategy. We show how LICORICE reduces manual labeling efforts to to 500 or fewer concept labels in three environments. Finally, we present an initial study to explore how we can use powerful vision-language models to infer concepts from raw visual inputs without explicit labels at minimal cost to performance.
The Rlign Algorithm for Enhanced Electrocardiogram Analysis through R-Peak Alignment for Explainable Classification and Clustering
Authors: Lucas Plagwitz, Lucas Bickmann, Michael Fujarski, Alexander Brenner, Warnes Gobalakrishnan, Lars Eckardt, Antonius Büscher, Julian Varghese
Date: 2024-07-22 00:00:00
Tasks: Clustering

Electrocardiogram (ECG) recordings have long been vital in diagnosing different cardiac conditions. Recently, research in the field of automatic ECG processing using machine learning methods has gained importance, mainly by utilizing deep learning methods on raw ECG signals. A major advantage of models like convolutional neural networks (CNNs) is their ability to effectively process biomedical imaging or signal data. However, this strength is tempered by challenges related to their lack of explainability, the need for a large amount of training data, and the complexities involved in adapting them for unsupervised clustering tasks. In addressing these tasks, we aim to reintroduce shallow learning techniques, including support vector machines and principal components analysis, into ECG signal processing by leveraging their semi-structured, cyclic form. To this end, we developed and evaluated a transformation that effectively restructures ECG signals into a fully structured format, facilitating their subsequent analysis using shallow learning algorithms. In this study, we present this adaptive transformative approach that aligns R-peaks across all signals in a dataset and resamples the segments between R-peaks, both with and without heart rate dependencies. We illustrate the substantial benefit of this transformation for traditional analysis techniques in the areas of classification, clustering, and explainability, outperforming commercial software for median beat transformation and CNN approaches. Our approach demonstrates a significant advantage for shallow machine learning methods over CNNs, especially when dealing with limited training data. Additionally, we release a fully tested and publicly accessible code framework, providing a robust alignment pipeline to support future research, available at https://github.com/imi-ms/rlign.
Conditional Language Policy: A General Framework for Steerable Multi-Objective Finetuning
Authors: Kaiwen Wang, Rahul Kidambi, Ryan Sullivan, Alekh Agarwal, Christoph Dann, Andrea Michi, Marco Gelmi, Yunxuan Li, Raghav Gupta, Avinava Dubey, Alexandre Ramé, Johan Ferret, Geoffrey Cideron, Le Hou, Hongkun Yu, Amr Ahmed, Aranyak Mehta, Léonard Hussenot, Olivier Bachem, Edouard Leurent
Date: 2024-07-22 00:00:00

Reward-based finetuning is crucial for aligning language policies with intended behaviors (e.g., creativity and safety). A key challenge is to develop steerable language models that trade-off multiple (conflicting) objectives in a flexible and efficient manner. This paper presents Conditional Language Policy (CLP), a general framework for finetuning language models on multiple objectives. Building on techniques from multi-task training and parameter-efficient finetuning, CLP learn steerable models that effectively trade-off conflicting objectives at inference time. Notably, this does not require training or maintaining multiple models to achieve different trade-offs between the objectives. Through extensive experiments and ablations on two summarization datasets, we show that CLP learns steerable language models that outperform and Pareto-dominate the existing approaches for multi-objective finetuning.
Pulse Shaping for Random ISAC Signals: The Ambiguity Function Between Symbols Matters
Authors: Zihan Liao, Fan Liu, Shuangyang Li, Yifeng Xiong, Weijie Yuan, Christos Masouros, Marco Lops
Date: 2024-07-22 00:00:00
Tasks: ISAC

Integrated sensing and communications (ISAC) has emerged as a pivotal enabling technology for next-generation wireless networks. Despite the distinct signal design requirements of sensing and communication (S&C) systems, shifting the symbol-wise pulse shaping (SWiPS) framework from communication-only systems to ISAC poses significant challenges in signal design and processing This paper addresses these challenges by examining the ambiguity function (AF) of the SWiPS ISAC signal and introducing a novel pulse shaping design for single-carrier ISAC transmission. We formulate optimization problems to minimize the average integrated sidelobe level (ISL) of the AF, as well as the weighted ISL (WISL) while satisfying inter-symbol interference (ISI), out-of-band emission (OOBE), and power constraints. Our contributions include establishing the relationship between the AFs of both the random data symbols and signaling pulses, analyzing the statistical characteristics of the AF, and developing algorithmic frameworks for pulse shaping optimization using successive convex approximation (SCA) and alternating direction method of multipliers (ADMM) approaches. Numerical results are provided to validate our theoretical analysis, which demonstrate significant performance improvements in the proposed SWiPS design compared to the root-raised cosine (RRC) pulse shaping for conventional communication systems.
Securing V2I Backscattering from Eavesdropper
Authors: Ruotong Zhao, Deepak Mishra, Aruna Seneviratne
Date: 2024-07-22 00:00:00

As our cities become more intelligent and more connected with new technologies like 6G, improving communication between vehicles and infrastructure is essential while reducing energy consumption. This study proposes a secure framework for vehicle-to-infrastructure (V2I) backscattering near an eavesdropping vehicle to maximize the sum secrecy rate of V2I backscatter communication over multiple coherence slots. This sustainable framework aims to jointly optimize the reflection coefficients at the backscattering vehicle, carrier emitter power, and artificial noise at the infrastructure, along with the target vehicle's linear trajectory in the presence of an eavesdropping vehicle in the parallel lane. To achieve this optimization, we separated the problem into three parts: backscattering coefficient, power allocation, and trajectory design problems. We respectively adopted parallel computing, fractional programming, and finding all the candidates for the global optimal solution to obtain the global optimal solution for these three problems. Our simulations verified the fast convergence of our alternating optimization algorithm and showed that our proposed secure V2I backscattering outperforms the existing benchmark by over 4.7 times in terms of secrecy rate for 50 slots. Overall, this fundamental research on V2I backscattering provided insights to improve vehicular communication's connectivity, efficiency, and security.
Model editing for distribution shifts in uranium oxide morphological analysis
Authors: Davis Brown, Cody Nizinski, Madelyn Shapiro, Corey Fallon, Tianzhixi Yin, Henry Kvinge, Jonathan H. Tu
Date: 2024-07-22 00:00:00
Tasks: Deep Learning, Model Editing, Morphological Analysis

Deep learning still struggles with certain kinds of scientific data. Notably, pretraining data may not provide coverage of relevant distribution shifts (e.g., shifts induced via the use of different measurement instruments). We consider deep learning models trained to classify the synthesis conditions of uranium ore concentrates (UOCs) and show that model editing is particularly effective for improving generalization to distribution shifts common in this domain. In particular, model editing outperforms finetuning on two curated datasets comprising of micrographs taken of U$_{3}$O$_{8}$ aged in humidity chambers and micrographs acquired with different scanning electron microscopes, respectively.
Uplink Transmit Power Optimization for Distributed Massive MIMO Systems with 1-Bit ADCs
Authors: Bikshapathi Gouda, Italo Atzeni, Antti Tölli
Date: 2024-07-22 00:00:00
Tasks: Quantization

This paper addresses the problem of uplink transmit power optimization in distributed massive multiple-input multiple-output systems, where remote radio heads (RRHs) are equipped with 1-bit analog-to-digital converters (ADCs). First, in a scenario where a single RRH serves a single user equipment (UE), the signal-to-noise-and-distortion ratio (SNDR) is shown to be a non-monotonic and unimodal function of the UE transmit power due to the quantization distortion (QD). Upon the introduction of multiple RRHs, adding properly tuned dithering at each RRH is shown to render the SNDR at the output of the joint receiver unimodal. In a scenario with multiple RRHs and UEs, considering the non-monotonic nature of the signal-to-interference-plus-noise-and-distortion ratio (SINDR), both the UE transmit powers and the RRH dithering levels are jointly optimized subject to the min-power and max-min-SINDR criteria, while employing Bussgang-based maximum ratio combining (BMRC) and minimum mean squared error (BMMSE) receivers. To this end, gradient and block coordinate descent methods are introduced to tune the UE transmit powers, whereas a line search coupled with gradient updates is used to adjust the RRH dithering levels. Numerical results demonstrate that jointly optimizing the UE transmit power and the RRH dithering levels can significantly enhance the system performance, thus facilitating joint reception from multiple RRHs across a range of scenarios. Comparing the BMMSE and BMRC receivers, the former offers a better interference and QD alleviation while the latter has a lower computational complexity.