pwc-archive/papers-with-abstracts huggingface dataset:
On Exact Bayesian Credible Sets for Classification and Pattern Recognition
Authors: Chaegeun Song, Bing Li
Date: 2023-08-21 00:00:00
Tasks: Bayesian Inference, Classification, LEMMA

The current definition of a Bayesian credible set cannot, in general, achieve an arbitrarily preassigned credible level. This drawback is particularly acute for classification problems, where there are only a finite number of achievable credible levels. As a result, there is as of today no general way to construct an exact credible set for classification. In this paper, we introduce a generalized credible set that can achieve any preassigned credible level. The key insight is a simple connection between the Bayesian highest posterior density credible set and the Neyman--Pearson lemma, which, as far as we know, hasn't been noticed before. Using this connection, we introduce a randomized decision rule to fill the gaps among the discrete credible levels. Accompanying this methodology, we also develop the Steering Wheel Plot to represent the credible set, which is useful in visualizing the uncertainty in classification. By developing the exact credible set for discrete parameters, we make the theory of Bayesian inference more complete.
Econometrics of Machine Learning Methods in Economic Forecasting
Authors: Andrii Babii, Eric Ghysels, Jonas Striaukas
Date: 2023-08-21 00:00:00
Tasks: Econometrics, Survey, Time Series

This paper surveys the recent advances in machine learning method for economic forecasting. The survey covers the following topics: nowcasting, textual data, panel and tensor data, high-dimensional Granger causality tests, time series cross-validation, classification with economic losses.
L^2R: Lifelong Learning for First-stage Retrieval with Backward-Compatible Representations
Authors: Yinqiong Cai, Keping Bi, Yixing Fan, Jiafeng Guo, Wei Chen, Xueqi Cheng
Date: 2023-08-22 00:00:00
Tasks: Lifelong learning, Retrieval

First-stage retrieval is a critical task that aims to retrieve relevant document candidates from a large-scale collection. While existing retrieval models have achieved impressive performance, they are mostly studied on static data sets, ignoring that in the real-world, the data on the Web is continuously growing with potential distribution drift. Consequently, retrievers trained on static old data may not suit new-coming data well and inevitably produce sub-optimal results. In this work, we study lifelong learning for first-stage retrieval, especially focusing on the setting where the emerging documents are unlabeled since relevance annotation is expensive and may not keep up with data emergence. Under this setting, we aim to develop model updating with two goals: (1) to effectively adapt to the evolving distribution with the unlabeled new-coming data, and (2) to avoid re-inferring all embeddings of old documents to efficiently update the index each time the model is updated. We first formalize the task and then propose a novel Lifelong Learning method for the first-stage Retrieval, namely L^2R. L^2R adopts the typical memory mechanism for lifelong learning, and incorporates two crucial components: (1) selecting diverse support negatives for model training and memory updating for effective model adaptation, and (2) a ranking alignment objective to ensure the backward-compatibility of representations to save the cost of index rebuilding without hurting the model performance. For evaluation, we construct two new benchmarks from LoTTE and Multi-CPR datasets to simulate the document distribution drift in realistic retrieval scenarios. Extensive experiments show that L^2R significantly outperforms competitive lifelong learning baselines.
Pre-training with Aspect-Content Text Mutual Prediction for Multi-Aspect Dense Retrieval
Authors: Xiaojie Sun, Keping Bi, Jiafeng Guo, Xinyu Ma, Fan Yixing, Hongyu Shan, Qishen Zhang, Zhongyi Liu
Date: 2023-08-22 00:00:00
Tasks: Language Modeling, Language Modelling, Masked Language Modeling, Retrieval

Grounded on pre-trained language models (PLMs), dense retrieval has been studied extensively on plain text. In contrast, there has been little research on retrieving data with multiple aspects using dense models. In the scenarios such as product search, the aspect information plays an essential role in relevance matching, e.g., category: Electronics, Computers, and Pet Supplies. A common way of leveraging aspect information for multi-aspect retrieval is to introduce an auxiliary classification objective, i.e., using item contents to predict the annotated value IDs of item aspects. However, by learning the value embeddings from scratch, this approach may not capture the various semantic similarities between the values sufficiently. To address this limitation, we leverage the aspect information as text strings rather than class IDs during pre-training so that their semantic similarities can be naturally captured in the PLMs. To facilitate effective retrieval with the aspect strings, we propose mutual prediction objectives between the text of the item aspect and content. In this way, our model makes more sufficient use of aspect information than conducting undifferentiated masked language modeling (MLM) on the concatenated text of aspects and content. Extensive experiments on two real-world datasets (product and mini-program search) show that our approach can outperform competitive baselines both treating aspect values as classes and conducting the same MLM for aspect and content strings. Code and related dataset will be available at the URL \footnote{https://github.com/sunxiaojie99/ATTEMPT}.
Improved mirror ball projection for more accurate merging of multiple camera outputs and process monitoring
Authors: Wladislav Artsimovich, Yoko Hirono
Date: 2023-08-15 00:00:00

Using spherical mirrors in place of wide-angle cameras allows for cost-effective monitoring of manufacturing processes in hazardous environment, where a camera would normally not operate. This includes environments of high heat, vacuum and strong electromagnetic fields. Moreover, it allows the layering of multiple camera types (e.g., color image, near-infrared, long-wavelength infrared, ultraviolet) into a single wide-angle output, whilst accounting for the different camera placements and lenses used. Normally, the different camera positions introduce a parallax shift between the images, but with a spherical projection as produced by a spherical mirror, this parallax shift is reduced, depending on mirror size and distance to the monitoring target. This paper introduces a variation of the 'mirror ball projection', that accounts for distortion produced by a perspective camera at the pole of the projection. Finally, the efficacy of process monitoring via a mirror ball is evaluated.
AI For Fraud Awareness
Authors: Prabh Simran Singh Baweja, Orathai Sangpetch, Akkarit Sangpetch
Date: 2023-08-16 00:00:00
Tasks: Active Learning, Game Design

In today's world, with the rise of numerous social platforms, it has become relatively easy for anyone to spread false information and lure people into traps. Fraudulent schemes and traps are growing rapidly in the investment world. Due to this, countries and individuals face huge financial risks. We present an awareness system with the use of machine learning and gamification techniques to educate the people about investment scams and traps. Our system applies machine learning techniques to provide a personalized learning experience to the user. The system chooses distinct game-design elements and scams from the knowledge pool crafted by domain experts for each individual. The objective of the research project is to reduce inequalities in all countries by educating investors via Active Learning. Our goal is to assist the regulators in assuring a conducive environment for a fair, efficient, and inclusive capital market. In the paper, we discuss the impact of the problem, provide implementation details, and showcase the potentiality of the system through preliminary experiments and results.
Non-Bayesian Post-Model-Selection Estimation as Estimation Under Model Misspecification
Authors: Nadav Harel, Tirza Routtenberg
Date: 2023-08-22 00:00:00
Tasks: channel selection, model, Model Selection, parameter estimation

In many parameter estimation problems, the exact model is unknown and is assumed to belong to a set of candidate models. In such cases, a predetermined data-based selection rule selects a parametric model from a set of candidates before the parameter estimation. The existing framework for estimation under model misspecification does not account for the selection process that led to the misspecified model. Moreover, in post-model-selection estimation, there are multiple candidate models chosen based on the observations, making the interpretation of the assumed model in the misspecified setting non-trivial. In this work, we present three interpretations to address the problem of non-Bayesian post-model-selection estimation as an estimation under model misspecification problem: the naive interpretation, the normalized interpretation, and the selective inference interpretation, and discuss their properties. For each of these interpretations, we developed the corresponding misspecified maximum likelihood estimator and the misspecified Cram$\acute{\text{e}}$r-Rao-type lower bound. The relations between the estimators and the performance bounds, as well as their properties, are discussed. Finally, we demonstrate the performance of the proposed estimators and bounds via simulations of estimation after channel selection. We show that the proposed performance bounds are more informative than the oracle Cram$\acute{\text{e}}$r-Rao Bound (CRB), where the third interpretation (selective inference) results in the lowest mean-squared-error (MSE) among the estimators.
Evaluation of the Speech Resynthesis Capabilities of the VoicePrivacy Challenge Baseline B1
Authors: Ünal Ege Gaznepoglu, Nils Peters
Date: 2023-08-22 00:00:00
Tasks: Resynthesis, Speaker anonymization

Speaker anonymization systems continue to improve their ability to obfuscate the original speaker characteristics in a speech signal, but often create processing artifacts and unnatural sounding voices as a tradeoff. Many of those systems stem from the VoicePrivacy Challenge (VPC) Baseline B1, using a neural vocoder to synthesize speech from an F0, x-vectors and bottleneck features-based speech representation. Inspired by this, we investigate the reproduction capabilities of the aforementioned baseline, to assess how successful the shared methodology is in synthesizing human-like speech. We use four objective metrics to measure speech quality, waveform similarity, and F0 similarity. Our findings indicate that both the speech representation and the vocoder introduces artifacts, causing an unnatural perception. A MUSHRA-like listening test on 18 subjects corroborate our findings, motivating further research on the analysis and synthesis components of the VPC Baseline B1.
Attitude Determination in Urban Canyons: A Synergy between GNSS and 5G Observations
Authors: Pinjun Zheng, Xing Liu, Tarig Ballal, Tareq Y. Al-Naffouri
Date: 2023-08-22 00:00:00

This paper considers the attitude determination problem based on the global navigation satellite system (GNSS) and fifth-generation (5G) measurement fusion to address the shortcomings of standalone GNSS and 5G techniques in deep urban regions. The tight fusion of the GNSS and the 5G observations results in a unique hybrid integer- and orthonormality-constrained optimization problem. To solve this problem, we propose an estimation method consisting of the steps of float solution computation, ambiguity resolution, and fixed solution computation. Numerical results reveal that the proposed method can effectively improve the attitude determination accuracy and reliability compared to either the pure GNSS solution or the pure 5G solution.
A Partially Observable Deep Multi-Agent Active Inference Framework for Resource Allocation in 6G and Beyond Wireless Communications Networks
Authors: Fuhui Zhou, Rui Ding, Qihui Wu, Derrick Wing Kwan Ng, Kai-Kit Wong, Naofal Al-Dhahir
Date: 2023-08-22 00:00:00

Resource allocation is of crucial importance in wireless communications. However, it is extremely challenging to design efficient resource allocation schemes for future wireless communication networks since the formulated resource allocation problems are generally non-convex and consist of various coupled variables. Moreover, the dynamic changes of practical wireless communication environment and user service requirements thirst for efficient real-time resource allocation. To tackle these issues, a novel partially observable deep multi-agent active inference (PODMAI) framework is proposed for realizing intelligent resource allocation. A belief based learning method is exploited for updating the policy by minimizing the variational free energy. A decentralized training with a decentralized execution multi-agent strategy is designed to overcome the limitations of the partially observable state information. Exploited the proposed framework, an intelligent spectrum allocation and trajectory optimization scheme is developed for a spectrum sharing unmanned aerial vehicle (UAV) network with dynamic transmission rate requirements as an example. Simulation results demonstrate that our proposed framework can significantly improve the sum transmission rate of the secondary network compared to various benchmark schemes. Moreover, the convergence speed of the proposed PODMAI is significantly improved compared with the conventional reinforcement learning framework. Overall, our proposed framework can enrich the intelligent resource allocation frameworks and pave the way for realizing real-time resource allocation.
Distributed Energy Resource Management: All-Time Resource-Demand Feasibility, Delay-Tolerance, Nonlinearity, and Beyond
Authors: Mohammadreza Doostmohammadian
Date: 2023-08-22 00:00:00
Tasks: All, energy management, Management, Quantization, Scheduling

In this work, we propose distributed and networked energy management scenarios to optimize the production and reservation of energy among a set of distributed energy nodes. In other words, the idea is to optimally allocate the generated and reserved powers based on nodes' local cost gradient information while meeting the demand energy. One main concern is the all-time (or anytime) resource-demand feasibility, implying that at all iterations of the scheduling algorithm, the balance between the produced power and demand plus reserved power must hold. The other concern is to design algorithms to tolerate communication time-delays and changes in the network. Further, one can incorporate possible model nonlinearity in the algorithm to address both inherent (e.g., saturation and quantization) and purposefully-added (e.g., signum-based) nonlinearities in the model. The proposed optimal allocation algorithm addresses all the above concerns, while it benefits from possible features of the distributed (or networked) solutions such as no-single-node-of-failure and distributed information processing. We show both the all-time feasibility of the proposed scheme and its convergence under certain bound on the step-rate using Lyapunov-type proofs.
Feedback linearization through the lens of data
Authors: C. De Persis, D. Gadginmath, F. Pasqualetti, P. Tesi
Date: 2023-08-22 00:00:00
Tasks: valid

Controlling nonlinear systems, especially when data are being used to offset uncertainties in the model, is hard. A natural approach when dealing with the challenges of nonlinear control is to reduce the system to a linear one via change of coordinates and feedback, an approach commonly known as feedback linearization. Here we consider the feedback linearization problem of an unknown system when the solution must be found using experimental data. We propose a new method that learns the change of coordinates and the linearizing controller from a library (a dictionary) of candidate functions with a simple algebraic procedure - the computation of the null space of a data-dependent matrix. Remarkably, we show that the solution is valid over the entire state space of interest and not just on the dataset used to determine the solution.
Constructive Equivariant Observer Design for Inertial Navigation
Authors: Pieter van Goor, Tarek Hamel, Robert Mahony
Date: 2023-08-22 00:00:00
Tasks: Position

Inertial Navigation Systems (INS) are algorithms that fuse inertial measurements of angular velocity and specific acceleration with supplementary sensors including GNSS and magnetometers to estimate the position, velocity and attitude, or extended pose, of a vehicle. The industry-standard extended Kalman filter (EKF) does not come with strong stability or robustness guarantees and can be subject to catastrophic failure. This paper exploits a Lie group symmetry of the INS dynamics to propose the first nonlinear observer for INS with error dynamics that are almost-globally asymptotically and locally exponentially stable, independently of the chosen gains. The observer is aided only by a GNSS measurement of position. As expected, the convergence guarantee depends on persistence of excitation of the vehicle's specific acceleration in the inertial frame. Simulation results demonstrate the observer's performance and its ability to converge from extreme errors in the initial state estimates.
Deep Learning Techniques in Extreme Weather Events: A Review
Authors: Shikha Verma, Kuldeep Srivastava, Akhilesh Tiwari, Shekhar Verma
Date: 2023-08-18 00:00:00
Tasks: Deep Learning, Weather Forecasting

Extreme weather events pose significant challenges, thereby demanding techniques for accurate analysis and precise forecasting to mitigate its impact. In recent years, deep learning techniques have emerged as a promising approach for weather forecasting and understanding the dynamics of extreme weather events. This review aims to provide a comprehensive overview of the state-of-the-art deep learning in the field. We explore the utilization of deep learning architectures, across various aspects of weather prediction such as thunderstorm, lightning, precipitation, drought, heatwave, cold waves and tropical cyclones. We highlight the potential of deep learning, such as its ability to capture complex patterns and non-linear relationships. Additionally, we discuss the limitations of current approaches and highlight future directions for advancements in the field of meteorology. The insights gained from this systematic review are crucial for the scientific community to make informed decisions and mitigate the impacts of extreme weather events.
TrajPy: empowering feature engineering for trajectory analysis across domains
Authors: Maurício Moreira-Soares, Eduardo Mossmann, Rui D. M. Travasso, José Rafael Bordin
Date: 2023-08-22 00:00:00
Tasks: Feature Engineering

Trajectories, sequentially measured quantities that form a path, are an important presence in many different fields, from hadronic beams in physics to electrocardiograms in medicine. Trajectory anal-ysis requires the quantification and classification of curves either using statistical descriptors or physics-based features. To date, there is no extensive and user-friendly package for trajectory anal-ysis available, despite its importance and potential application across domains. We developed a free open-source python package named TrajPy as a complementary tool to empower trajectory analysis. The package showcases a friendly graphic user interface and provides a set of physical descriptors that help characterizing these intricate structures. In combina-tion with image analysis, it was already successfully applied to the study of mitochondrial motility in neuroblastoma cell lines and to the analysis of in silico models for cell migration. The TrajPy package was developed in Python 3 and released under the GNU GPL-3 license. Easy installation is available through PyPi and the development source code can be found in the repository https://github.com/ocbe-uio/TrajPy/. The package release is automatically archived under the DOI 10.5281/zenodo.3656044.
Classical Economics: Lost and Found
Authors: Sabiou Inoua, Vernon Smith
Date: 2023-08-21 00:00:00

"Economists miss the boat when they act as if Arrow and Debreu's general equilibrium model accurately describes markets in the real world of constant change. In contrast, the classical view on the market mechanism offers a helpful foundation on which to add modern insights about how markets create and coordinate information."
Nash Equilibrium Existence without Convexity
Authors: Conrad Kosowsky
Date: 2023-08-22 00:00:00

In this paper, I prove the existence of a pure-strategy Nash equilibrium for a large class of games with nonconvex strategy spaces. Specifically, if each player's strategies form a compact, connected Euclidean neighborhood retract and if all best-response correspondences are null-homotopic, then the game has a pure-strategy Nash equilibrium. As an application, I show how this result can prove the fundamental theorem of algebra.
Mitigating Aberration-Induced Noise: A Deep Learning-Based Aberration-to-Aberration Approach
Authors: Mostafa Sharifzadeh, Sobhan Goudarzi, An Tang, Habib Benali, Hassan Rivaz
Date: 2023-08-22 00:00:00
Tasks: Deep Learning

One of the primary sources of suboptimal image quality in ultrasound imaging is phase aberration. It is caused by spatial changes in sound speed over a heterogeneous medium, which disturbs the transmitted waves and prevents coherent summation of echo signals. Obtaining non-aberrated ground truths in real-world scenarios can be extremely challenging, if not impossible. This challenge hinders the performance of deep learning-based techniques due to the domain shift between simulated and experimental data. Here, for the first time, we propose a deep learning-based method that does not require ground truth to correct the phase aberration problem and, as such, can be directly trained on real data. We train a network wherein both the input and target output are randomly aberrated radio frequency (RF) data. Moreover, we demonstrate that a conventional loss function such as mean square error is inadequate for training such a network to achieve optimal performance. Instead, we propose an adaptive mixed loss function that employs both B-mode and RF data, resulting in more efficient convergence and enhanced performance. Finally, we publicly release our dataset, comprising over 180,000 aberrated single plane-wave images (RF data), wherein phase aberrations are modeled as near-field phase screens. Although not utilized in the proposed method, each aberrated image is paired with its corresponding aberration profile and the non-aberrated version, aiming to mitigate the data scarcity problem in developing deep learning-based techniques for phase aberration correction.