pwc-archive/papers-with-abstracts huggingface dataset:
Networks' modulation: How different structural network properties affect the global synchronization of coupled Kuramoto oscillators
Authors: Juliette Courson, Thanos Manos, Mathias Quoy
Date: 2023-02-24 00:00:00
Tasks: Clustering, Rhythm

In a large variety of systems (biological, physical, social etc.), synchronization occurs when different oscillating objects tune their rhythm when they interact with each other. The different underlying network defining the connectivity properties among these objects drives the global dynamics in a complex fashion and affects the global degree of synchrony of the system. Here we study the impact of such types of different network architectures, such as Fully-Connected, Random, Regular ring lattice graph, Small-World and Scale-Free in the global dynamical activity of a system of coupled Kuramoto phase oscillators. We fix the external stimulation parameters and we measure the global degree of synchrony when different fractions of nodes receive stimulus. These nodes are chosen either randomly or based on their respective strong/weak connectivity properties (centrality, shortest path length and clustering coefficient). Our main finding is, that in Scale-Free and Random networks a sophisticated choice of nodes based on their eigenvector centrality and average shortest path length exhibits a systematic trend in achieving higher degree of synchrony. However, this trend does not occur when using the clustering coefficient as a criterion. For the other types of graphs considered, the choice of the stimulated nodes (randomly vs selectively using the aforementioned criteria) does not seem to have a noticeable effect.
ChatGPT and Other Large Language Models as Evolutionary Engines for Online Interactive Collaborative Game Design
Authors: Pier Luca Lanzi, Daniele Loiacono
Date: 2023-02-09 00:00:00
Tasks: Game Design, Language Modeling, Language Modelling

Large language models (LLMs) have taken the scientific world by storm, changing the landscape of natural language processing and human-computer interaction. These powerful tools can answer complex questions and, surprisingly, perform challenging creative tasks (e.g., generate code and applications to solve problems, write stories, pieces of music, etc.). In this paper, we present a collaborative game design framework that combines interactive evolution and large language models to simulate the typical human design process. We use the former to exploit users' feedback for selecting the most promising ideas and large language models for a very complex creative task - the recombination and variation of ideas. In our framework, the process starts with a brief and a set of candidate designs, either generated using a language model or proposed by the users. Next, users collaborate on the design process by providing feedback to an interactive genetic algorithm that selects, recombines, and mutates the most promising designs. We evaluated our framework on three game design tasks with human designers who collaborated remotely.
Iterative Approximate Cross-Validation
Authors: Yuetian Luo, Zhimei Ren, Rina Foygel Barber
Date: 2023-03-05 00:00:00
Tasks: Computational Efficiency

Cross-validation (CV) is one of the most popular tools for assessing and selecting predictive models. However, standard CV suffers from high computational cost when the number of folds is large. Recently, under the empirical risk minimization (ERM) framework, a line of works proposed efficient methods to approximate CV based on the solution of the ERM problem trained on the full dataset. However, in large-scale problems, it can be hard to obtain the exact solution of the ERM problem, either due to limited computational resources or due to early stopping as a way of preventing overfitting. In this paper, we propose a new paradigm to efficiently approximate CV when the ERM problem is solved via an iterative first-order algorithm, without running until convergence. Our new method extends existing guarantees for CV approximation to hold along the whole trajectory of the algorithm, including at convergence, thus generalizing existing CV approximation methods. Finally, we illustrate the accuracy and computational efficiency of our method through a range of empirical studies.
Self-reinforced polynomial approximation methods for concentrated probability densities
Authors: Tiangang Cui, Sergey Dolgov, Olivier Zahm
Date: 2023-03-05 00:00:00
Tasks: Math

Transport map methods offer a powerful statistical learning tool that can couple a target high-dimensional random variable with some reference random variable using invertible transformations. This paper presents new computational techniques for building the Knothe--Rosenblatt (KR) rearrangement based on general separable functions. We first introduce a new construction of the KR rearrangement -- with guaranteed invertibility in its numerical implementation -- based on approximating the density of the target random variable using tensor-product spectral polynomials and downward closed sparse index sets. Compared to other constructions of KR arrangements based on either multi-linear approximations or nonlinear optimizations, our new construction only relies on a weighted least square approximation procedure. Then, inspired by the recently developed deep tensor trains (Cui and Dolgov, Found. Comput. Math. 22:1863--1922, 2022), we enhance the approximation power of sparse polynomials by preconditioning the density approximation problem using compositions of maps. This is particularly suitable for high-dimensional and concentrated probability densities commonly seen in many applications. We approximate the complicated target density by a composition of self-reinforced KR rearrangements, in which previously constructed KR rearrangements -- based on the same approximation ansatz -- are used to precondition the density approximation problem for building each new KR rearrangement. We demonstrate the efficiency of our proposed methods and the importance of using the composite map on several inverse problems governed by ordinary differential equations (ODEs) and partial differential equations (PDEs).
Progressive Bayesian Particle Flows based on Optimal Transport Map Sequences
Authors: Uwe D. Hanebeck
Date: 2023-03-04 00:00:00
Tasks: Density Estimation

We propose a method for optimal Bayesian filtering with deterministic particles. In order to avoid particle degeneration, the filter step is not performed at once. Instead, the particles progressively flow from prior to posterior. This is achieved by splitting the filter step into a series of sub-steps. In each sub-step, optimal resampling is done by a map that replaces non-equally weighted particles with equally weighted ones. Inversions of the maps or monotonicity constraints are not required, greatly simplifying the procedure. The parameters of the mapping network are optimized w.r.t.\ to a particle set distance. This distance is differentiable, and compares non-equally and equally weighted particles. Composition of the map sequence provides a final mapping from prior to posterior particles. Radial basis function neural networks are used as maps. It is important that no intermediate continuous density representation is required. The entire flow works directly with particle representations. This avoids costly density estimation.
Eryn : A multi-purpose sampler for Bayesian inference
Authors: Nikolaos Karnesis, Michael L. Katz, Natalia Korsakova, Jonathan R. Gair, Nikolaos Stergioulas
Date: 2023-03-03 00:00:00
Tasks: Astronomy, Bayesian Inference, Model Selection, parameter estimation

In recent years, methods for Bayesian inference have been widely used in many different problems in physics where detection and characterization are necessary. Data analysis in gravitational-wave astronomy is a prime example of such a case. Bayesian inference has been very successful because this technique provides a representation of the parameters as a posterior probability distribution, with uncertainties informed by the precision of the experimental measurements. During the last couple of decades, many specific advances have been proposed and employed in order to solve a large variety of different problems. In this work, we present a Markov Chain Monte Carlo (MCMC) algorithm that integrates many of those concepts into a single MCMC package. For this purpose, we have built {\tt Eryn}, a user-friendly and multipurpose toolbox for Bayesian inference, which can be utilized for solving parameter estimation and model selection problems, ranging from simple inference questions, to those with large-scale model variation requiring trans-dimensional MCMC methods, like the LISA global fit problem. In this paper, we describe this sampler package and illustrate its capabilities on a variety of use cases.
LongEval-Retrieval: French-English Dynamic Test Collection for Continuous Web Search Evaluation
Authors: Petra Galuščáková Romain Deveaud, Gabriela Gonzalez-Saez, Philippe Mulhem, Lorraine Goeuriot, Florina Piroi, Martin Popel
Date: 2023-03-06 00:00:00
Tasks: Information Retrieval, Privacy Preserving, Retrieval

LongEval-Retrieval is a Web document retrieval benchmark that focuses on continuous retrieval evaluation. This test collection is intended to be used to study the temporal persistence of Information Retrieval systems and will be used as the test collection in the Longitudinal Evaluation of Model Performance Track (LongEval) at CLEF 2023. This benchmark simulates an evolving information system environment - such as the one a Web search engine operates in - where the document collection, the query distribution, and relevance all move continuously, while following the Cranfield paradigm for offline evaluation. To do that, we introduce the concept of a dynamic test collection that is composed of successive sub-collections each representing the state of an information system at a given time step. In LongEval-Retrieval, each sub-collection contains a set of queries, documents, and soft relevance assessments built from click models. The data comes from Qwant, a privacy-preserving Web search engine that primarily focuses on the French market. LongEval-Retrieval also provides a 'mirror' collection: it is initially constructed in the French language to benefit from the majority of Qwant's traffic, before being translated to English. This paper presents the creation process of LongEval-Retrieval and provides baseline runs and analysis.
Privacy-Preserving Fair Item Ranking
Authors: Jia Ao Sun, Sikha Pentyala, Martine De Cock, Golnoosh Farnadi
Date: 2023-03-06 00:00:00
Tasks: Fairness, Privacy Preserving

Users worldwide access massive amounts of curated data in the form of rankings on a daily basis. The societal impact of this ease of access has been studied and work has been done to propose and enforce various notions of fairness in rankings. Current computational methods for fair item ranking rely on disclosing user data to a centralized server, which gives rise to privacy concerns for the users. This work is the first to advance research at the conjunction of producer (item) fairness and consumer (user) privacy in rankings by exploring the incorporation of privacy-preserving techniques; specifically, differential privacy and secure multi-party computation. Our work extends the equity of amortized attention ranking mechanism to be privacy-preserving, and we evaluate its effects with respect to privacy, fairness, and ranking quality. Our results using real-world datasets show that we are able to effectively preserve the privacy of users and mitigate unfairness of items without making additional sacrifices to the quality of rankings in comparison to the ranking mechanism in the clear.
A Survey on Incremental Update for Neural Recommender Systems
Authors: Peiyan Zhang, Sunghun Kim
Date: 2023-03-06 00:00:00
Tasks: Recommendation Systems, Survey

Recommender Systems (RS) aim to provide personalized suggestions of items for users against consumer over-choice. Although extensive research has been conducted to address different aspects and challenges of RS, there still exists a gap between academic research and industrial applications. Specifically, most of the existing models still work in an offline manner, in which the recommender is trained on a large static training set and evaluated on a very restrictive testing set in a one-time process. RS will stay unchanged until the next batch retrain is performed. We frame such RS as Batch Update Recommender Systems (BURS). In reality, they have to face the challenges where RS are expected to be instantly updated with new data streaming in, and generate updated recommendations for current user activities based on the newly arrived data. We frame such RS as Incremental Update Recommender Systems (IURS). In this article, we offer a systematic survey of incremental update for neural recommender systems. We begin the survey by introducing key concepts and formulating the task of IURS. We then illustrate the challenges in IURS compared with traditional BURS. Afterwards, we detail the introduction of existing literature and evaluation issues. We conclude the survey by outlining some prominent open research issues in this area.
A Self-Correcting Sequential Recommender
Authors: Yujie Lin, Chenyang Wang, Zhumin Chen, Zhaochun Ren, Xin Xin, Qiang Yan, Maarten de Rijke, Xiuzhen Cheng, Pengjie Ren
Date: 2023-03-04 00:00:00
Tasks: Self-Supervised Learning, Sequential Recommendation

Sequential recommendations aim to capture users' preferences from their historical interactions so as to predict the next item that they will interact with. Sequential recommendation methods usually assume that all items in a user's historical interactions reflect her/his preferences and transition patterns between items. However, real-world interaction data is imperfect in that (i) users might erroneously click on items, i.e., so-called misclicks on irrelevant items, and (ii) users might miss items, i.e., unexposed relevant items due to inaccurate recommendations. To tackle the two issues listed above, we propose STEAM, a Self-correcTing sEquentiAl recoMmender. STEAM first corrects an input item sequence by adjusting the misclicked and/or missed items. It then uses the corrected item sequence to train a recommender and make the next item prediction.We design an item-wise corrector that can adaptively select one type of operation for each item in the sequence. The operation types are 'keep', 'delete' and 'insert.' In order to train the item-wise corrector without requiring additional labeling, we design two self-supervised learning mechanisms: (i) deletion correction (i.e., deleting randomly inserted items), and (ii) insertion correction (i.e., predicting randomly deleted items). We integrate the corrector with the recommender by sharing the encoder and by training them jointly. We conduct extensive experiments on three real-world datasets and the experimental results demonstrate that STEAM outperforms state-of-the-art sequential recommendation baselines. Our in-depth analyses confirm that STEAM benefits from learning to correct the raw item sequences.
Obfuscation of Human Micro-Doppler Signatures in Passive Wireless RADAR
Authors: Antonios Argyriou
Date: 2023-03-06 00:00:00

When wireless communication signals impinge on a moving human they are affected by micro-Doppler. A passive receiver of the resulting signals can calculate the spectrogram that produces different signatures depending on the human activity. This constitutes a significant privacy breach when the human is unaware of it. This paper presents a methodology for preventing this when we want to do so by injecting into the transmitted signal frequency variations that obfuscate the micro-Doppler signature. We assume a system that uses orthogonal frequency division multiplexing (OFDM) and a passive receiver that estimates the spectrogram based on the instantaneous channel state information (CSI). We analyze the impact of our approach on the received signal and we propose two strategies that do not affect the demodulation of the digital communication signal at the intended receiver. To evaluate the performance of our approach we use an IEEE 802.11-based OFDM system and realistic human signal reflection models.
Navigates Like Me: Understanding How People Evaluate Human-Like AI in Video Games
Authors: Stephanie Milani, Arthur Juliani, Ida Momennejad, Raluca Georgescu, Jaroslaw Rzpecki, Alison Shaw, Gavin Costello, Fei Fang, Sam Devlin, Katja Hofmann
Date: 2023-03-02 00:00:00
Tasks: AI Agent

We aim to understand how people assess human likeness in navigation produced by people and artificially intelligent (AI) agents in a video game. To this end, we propose a novel AI agent with the goal of generating more human-like behavior. We collect hundreds of crowd-sourced assessments comparing the human-likeness of navigation behavior generated by our agent and baseline AI agents with human-generated behavior. Our proposed agent passes a Turing Test, while the baseline agents do not. By passing a Turing Test, we mean that human judges could not quantitatively distinguish between videos of a person and an AI agent navigating. To understand what people believe constitutes human-like navigation, we extensively analyze the justifications of these assessments. This work provides insights into the characteristics that people consider human-like in the context of goal-directed video game navigation, which is a key step for further improving human interactions with AI agents.
ML Codebook Design for Initial Access and CSI Type-II Feedback in Sub-6GHz 5G NR
Authors: Ryan M. Dreifuerst, Robert W. Heath Jr
Date: 2023-03-06 00:00:00
Tasks: Management, Quantization

Beam codebooks are a recent feature to enable high dimension multiple-input multiple-output in 5G. Codebooks comprised of customizable beamforming weights can be used to transmit reference signals and aid the channel state information (CSI) acquisition process. Codebooks are also used for quantizing feedback following CSI acquisition. In this paper, we characterize the role of each codebook used during the beam management process and design a neural network to find codebooks that improve overall system performance. Evaluating a codebook requires considering the system-level dependency between the codebooks, feedback, overhead, and spectral efficiency. The proposed neural network is built on translating codebook and feedback knowledge into a consistent beamspace basis similar to a virtual channel model to generate initial access codebooks. This beamspace codebook algorithm is designed to directly integrate with current 5G beam management standards without changing the feedback format or requiring additional side information. Our simulations show that the neural network codebooks improve over traditional codebooks, even in dispersive sub-6GHz environments. We further use our framework to evaluate CSI feedback formats with regard to multi-user spectral efficiency. Our results suggest that optimizing codebook performance can provide valuable performance improvements, but optimizing the feedback configuration is also important in sub-6GHz bands.
Safety-Critical Control with Bounded Inputs via Reduced Order Models
Authors: Tamas G. Molnar, Aaron D. Ames
Date: 2023-03-06 00:00:00

Guaranteeing safe behavior on complex autonomous systems -- from cars to walking robots -- is challenging due to the inherently high dimensional nature of these systems and the corresponding complex models that may be difficult to determine in practice. With this as motivation, this paper presents a safety-critical control framework that leverages reduced order models to ensure safety on the full order dynamics -- even when these models are subject to disturbances and bounded inputs (e.g., actuation limits). To handle input constraints, the backup set method is reformulated in the context of reduced order models, and conditions for the provably safe behavior of the full order system are derived. Then, the input-to-state safe backup set method is introduced to provide robustness against discrepancies between the reduced order model and the actual system. Finally, the proposed framework is demonstrated in high-fidelity simulation, where a quadrupedal robot is safely navigated around an obstacle with legged locomotion by the help of the unicycle model.
Cross-Lingual Transfer Learning for Alzheimer's Detection From Spontaneous Speech
Authors: Bastiaan Tamm, Rik Vandenberghe, Hugo Van hamme
Date: 2023-03-06 00:00:00
Tasks: Alzheimer's Detection, Cross-Lingual Transfer, Transfer Learning

Alzheimer's disease (AD) is a progressive neurodegenerative disease most often associated with memory deficits and cognitive decline. With the aging population, there has been much interest in automated methods for cognitive impairment detection. One approach that has attracted attention in recent years is AD detection through spontaneous speech. While the results are promising, it is not certain whether the learned speech features can be generalized across languages. To fill this gap, the ADReSS-M challenge was organized. This paper presents our submission to this ICASSP-2023 Signal Processing Grand Challenge (SPGC). The model was trained on 228 English samples of a picture description task and was transferred to Greek using only 8 samples. We obtained an accuracy of 82.6% for AD detection, a root-mean-square error of 4.345 for cognitive score prediction, and ranked 2nd place in the competition out of 24 competitors.
FoundationTTS: Text-to-Speech for ASR Customization with Generative Language Model
Authors: Ruiqing Xue, Yanqing Liu, Lei He, Xu Tan, Linquan Liu, Edward Lin, Sheng Zhao
Date: 2023-03-06 00:00:00
Tasks: Language Modeling, Language Modelling, Large Language Model, Speech Synthesis, text-to-speech, Text to Speech

Neural text-to-speech (TTS) generally consists of cascaded architecture with separately optimized acoustic model and vocoder, or end-to-end architecture with continuous mel-spectrograms or self-extracted speech frames as the intermediate representations to bridge acoustic model and vocoder, which suffers from two limitations: 1) the continuous acoustic frames are hard to predict with phoneme only, and acoustic information like duration or pitch is also needed to solve the one-to-many problem, which is not easy to scale on large scale and noise datasets; 2) to achieve diverse speech output based on continuous speech features, complex VAE or flow-based models are usually required. In this paper, we propose FoundationTTS, a new speech synthesis system with a neural audio codec for discrete speech token extraction and waveform reconstruction and a large language model for discrete token generation from linguistic (phoneme) tokens. Specifically, 1) we propose a hierarchical codec network based on vector-quantized auto-encoders with adversarial training (VQ-GAN), which first extracts continuous frame-level speech representations with fine-grained codec, and extracts a discrete token from each continuous speech frame with coarse-grained codec; 2) we jointly optimize speech token, linguistic tokens, speaker token together with a large language model and predict the discrete speech tokens autoregressively. Experiments show that FoundationTTS achieves a MOS gain of +0.14 compared to the baseline system. In ASR customization tasks, our method achieves 7.09\% and 10.35\% WERR respectively over two strong customized ASR baselines.