pwc-archive/papers-with-abstracts huggingface dataset:
Utilizing acceleration measurements to improve TDOA based localization
Authors: Marcin Kolakowski
Date: 2024-03-28 00:00:00
Tasks: TAG

In this paper localization using UWB positioning system and an inertial unit containing a single accelerometer is considered. The main part of the paper describes a novel algorithm for person localization. The algorithm is based on modified Extended Kalman Filter and utilizes TDOA (Time Difference of Arrival) results obtained from UWB system and results of acceleration measurement performed by the localized tag device. The proposed algorithm has been experimentally investigated through simulation and experiments. The results are included in the paper.
Dual-Frequency Radar Wave-Inversion for Sub-Surface Material Characterization
Authors: Ishfaq Aziz, Elahe Soltanaghai, Adam Watts, Mohamad Alipour
Date: 2024-03-28 00:00:00

Moisture estimation of sub-surface soil and the overlaying biomass layer is pivotal in precision agriculture and wildfire risk assessment. However, the characterization of layered material is nontrivial due to the radar penetration-resolution tradeoff. Here, a waveform inversion-based method was proposed for predicting the dielectric permittivity (as a moisture proxy) of the bottom soil layer and the top biomass layer from radar signals. Specifically, the use of a combination of a higher and a lower frequency radar compared to a single frequency in predicting the permittivity of both the soil and the overlaying layer was investigated in this study. The results show that each layer was best characterized via one of the frequencies. However, for the simultaneous prediction of both layers permittivity, the most consistent results were achieved by inversion of data from a combination of both frequencies, showing better correlation with in situ permittivity and reduced prediction errors.
First path component power based NLOS mitigation in UWB positioning system
Authors: Marcin Kolakowski, Jozef Modelski
Date: 2024-03-22 00:00:00
Tasks: TAG

The paper describes an NLOS (Non-Line-of-Sight) mitigation method intended for use in a UWB positioning system. In the proposed method propagation conditions between the localized objects and the anchors forming system infrastructure are classified into one of three categories: LOS (Line-of-Sight), NLOS and severe NLOS. Non-Line-of-Sight detection is conducted based on first path signal component power measurements. For each of the categories, average NLOS inducted time of arrival bias and bias standard deviation have been estimated based on results gathered during a measurement campaign conducted in a fully furnished apartment. To locate a tag, an EKF (Extended Kalman Filter) based algorithm is used. The proposed method of NLOS mitigation consists in correcting measurement results obtained in NLOS conditions and lowering their significance in a tag position estimation process. The paper includes the description of the method and the results of the conducted experiments.
Improving BLE Based Localization Accuracy Using Proximity Sensors
Authors: Marcin Kolakowski
Date: 2024-03-22 00:00:00
Tasks: Hybrid Positioning, Indoor Localization

Bluetooth Low Energy systems are one of the most popular solutions used for indoor localization. Unfortunately their accuracy might not be sufficient for some of the applications. One way to reduce localization errors is hybrid positioning, which combines measurement results obtained with different techniques. The paper describes a concept of a hybrid localization system in which Bluetooth Low Energy technology is supported with the use of laser proximity sensors. Results from both system parts are fused using a novel, simple positioning algorithm. The proposed system concept was tested using BLE and proximity sensors evaluation boards.
IDP-Bert: Predicting Properties of Intrinsically Disordered Proteins (IDP) Using Large Language Models
Authors: Parisa Mollaei, Danush Sadasivam, Chakradhar Guntuboina, Amir Barati Farimani
Date: 2024-03-28 00:00:00

Intrinsically Disordered Proteins (IDPs) constitute a large and structure-less class of proteins with significant functions. The existence of IDPs challenges the conventional notion that the biological functions of proteins rely on their three-dimensional structures. Despite lacking well-defined spatial arrangements, they exhibit diverse biological functions, influencing cellular processes and shedding light on the disease mechanisms. However, it is expensive to run experiments or simulations to characterize this class of proteins. Consequently, we designed an ML model that relies solely on amino acid sequences. In this study, we introduce IDP-Bert model, a deep-learning architecture leveraging Transformers and Protein Language Models (PLMs) to map sequences directly to IDPs properties. Our experiments demonstrate accurate predictions of IDPs properties, including Radius of Gyration, end-to-end Decorrelation Time, and Heat Capacity.
Reverse Degree-Based Topological Indices and QSPR Analysis of Cancer Drugs
Authors: H. M. Nagesh
Date: 2024-03-01 00:00:00

A topological index of a graph $G$ is a numerical quantity that describes its topology. Reverse degree-based topological indices play an important role in finding topological descriptors. Azacitidine, Decitabine, and Guadecitabine are hypomethylating agents which are used for the treatment of patients with higher-risk myelodysplastic syndromes, acute myeloid leukemia, and chronic myelomonocytic leukemia which are not suitable for in-depth treatments such as induction chemotherapy. In this article, some reverse degree-based topological indices of the three said drugs are computed. Furthermore, QSPR analysis of the said topological indices is discussed and it is shown that these topological indices are highly correlated with the physical properties of the three cancer drugs. These findings may help chemists and people working in the pharmaceutical industry to predict the properties of cancer drugs without experimenting.
A simple EEG-based decision tool for neonatal therapeutic hypothermia in hypoxic-ischemic encephalopathy
Authors: Marc Fiammante, Anne-Isabelle Vermersch, Marie Vidailhet, Mario Chavez
Date: 2024-03-29 00:00:00
Tasks: EEG, Electroencephalogram (EEG)

Accurate identification of hypoxic-ischemic brain injury in the early neonatal period is essential for initiating therapeutic hypothermia (TH) within 6 hours of birth to optimize neurodevelopmental outcomes. We aimed to develop a simple decision-making tool for identifying term neonates with hypoxic-ischemic encephalopathy (HIE) based on features of conventional electroencephalograms (EEG) recorded within 6 hours of birth. EEG recordings from 100 full-term neonates with HIE were graded by pediatric neurologists for severity. Amplitude in slow frequency bands was analyzed, focusing on delta (0.5-4 Hz) spectral power. Temporal fluctuations of delta power characterized each HIE grade, with joint level and duration probability densities estimated for delta oscillation power. This study is registered on clinicaltrials.gov (NCT05114070). These 2D EEG representations effectively distinguish mild HIE cases from those requiring hypothermia, achieving 98% accuracy, 99% sensitivity, 99% positive predictive value, 94% negative predictive value, an F1 score of 99%, and a false alarm rate of only 6%. This system accurately discriminates mild from moderate or severe HIE, with only one mild case mistakenly identified as requiring hypothermia. Quantized probability densities of delta spectral features from early EEG (within 6 hours of birth) revealed significant differences between mild and moderate or severe HIE, enabling accurate discrimination of candidates for TH. Simple, interpretable biomarkers from early EEG can provide an efficient visual clinical decision support tool to identify full-term neonates with HIE eligible for therapeutic hypothermia.
Enhancing Anomaly Detection in Financial Markets with an LLM-based Multi-Agent Framework
Authors: Taejin Park
Date: 2024-03-28 00:00:00
Tasks: Anomaly Detection, Language Modeling, Language Modelling, Large Language Model, Management

This paper introduces a Large Language Model (LLM)-based multi-agent framework designed to enhance anomaly detection within financial market data, tackling the longstanding challenge of manually verifying system-generated anomaly alerts. The framework harnesses a collaborative network of AI agents, each specialised in distinct functions including data conversion, expert analysis via web research, institutional knowledge utilization or cross-checking and report consolidation and management roles. By coordinating these agents towards a common objective, the framework provides a comprehensive and automated approach for validating and interpreting financial data anomalies. I analyse the S&P 500 index to demonstrate the framework's proficiency in enhancing the efficiency, accuracy and reduction of human intervention in financial market monitoring. The integration of AI's autonomous functionalities with established analytical methods not only underscores the framework's effectiveness in anomaly detection but also signals its broader applicability in supporting financial market monitoring.
Risk exchange under infinite-mean Pareto models
Authors: Yuyu Chen, Paul Embrechts, Ruodu Wang
Date: 2024-03-24 00:00:00

We study the optimal decisions of agents who aim to minimize their risks by allocating their positions over extremely heavy-tailed (i.e., infinite-mean) and possibly dependent losses. The loss distributions of our focus are super-Pareto distributions which include the class of extremely heavy-tailed Pareto distributions. For a portfolio of super-Pareto losses, non-diversification is preferred by decision makers equipped with well-defined and monotone risk measures. The phenomenon that diversification is not beneficial in the presence of super-Pareto losses is further illustrated by an equilibrium analysis in a risk exchange market. First, agents with super-Pareto losses will not share risks in a market equilibrium. Second, transferring losses from agents bearing super-Pareto losses to external parties without any losses may arrive at an equilibrium which benefits every party involved. The empirical studies show that extremely heavy tails exist in real datasets.
Analyzing the Roles of Language and Vision in Learning from Limited Data
Authors: Allison Chen, Ilia Sucholutsky, Olga Russakovsky, Thomas L. Griffiths
Date: 2024-02-15 00:00:00
Tasks: Language Modeling, Language Modelling

Does language help make sense of the visual world? How important is it to actually see the world rather than having it described with words? These basic questions about the nature of intelligence have been difficult to answer because we only had one example of an intelligent system -- humans -- and limited access to cases that isolated language or vision. However, the development of sophisticated Vision-Language Models (VLMs) by artificial intelligence researchers offers us new opportunities to explore the contributions that language and vision make to learning about the world. We ablate components from the cognitive architecture of these models to identify their contributions to learning new tasks from limited data. We find that a language model leveraging all components recovers a majority of a VLM's performance, despite its lack of visual input, and that language seems to allow this by providing access to prior knowledge and reasoning.
Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttention
Authors: Bin Gao, Zhuomin He, Puru Sharma, Qingxuan Kang, Djordje Jevdjic, Junbo Deng, Xingkun Yang, Zhou Yu, Pengfei Zuo
Date: 2024-03-23 00:00:00
Tasks: GPU, Language Modeling, Language Modelling, Large Language Model

Interacting with humans through multi-turn conversations is a fundamental feature of large language models (LLMs). However, existing LLM serving engines executing multi-turn conversations are inefficient due to the need to repeatedly compute the key-value (KV) caches of historical tokens, incurring high serving costs. To address the problem, this paper proposes CachedAttention, a new attention mechanism that enables reuse of KV caches across multi-turn conversations, significantly reducing the repetitive computation overheads. CachedAttention maintains a hierarchical KV caching system that leverages cost-effective memory/storage mediums to save KV caches for all requests. To reduce KV cache access overheads from slow mediums, CachedAttention employs layer-wise pre-loading and asynchronous saving schemes to overlap the KV cache access with the GPU computation. To ensure that the KV caches to be accessed are placed in the fastest hierarchy, CachedAttention employs scheduler-aware fetching and eviction schemes to consciously place the KV caches in different layers based on the hints from the inference job scheduler. To avoid the invalidation of the saved KV caches incurred by context window overflow, CachedAttention enables the saved KV caches to remain valid via decoupling the positional encoding and effectively truncating the KV caches. Extensive experimental results demonstrate that CachedAttention significantly decreases the time to the first token (TTFT) by up to 87%, improves the prompt prefilling throughput by up to 7.8$\times$ for multi-turn conversations, and reduces the end-to-end inference cost by up to 70%.
NJUST-KMG at TRAC-2024 Tasks 1 and 2: Offline Harm Potential Identification
Authors: Jingyuan Wang, Shengdong Xu, Yang Yang
Date: 2024-03-26 00:00:00
Tasks: Contrastive Learning

This report provide a detailed description of the method that we proposed in the TRAC-2024 Offline Harm Potential dentification which encloses two sub-tasks. The investigation utilized a rich dataset comprised of social media comments in several Indian languages, annotated with precision by expert judges to capture the nuanced implications for offline context harm. The objective assigned to the participants was to design algorithms capable of accurately assessing the likelihood of harm in given situations and identifying the most likely target(s) of offline harm. Our approach ranked second in two separate tracks, with F1 values of 0.73 and 0.96 respectively. Our method principally involved selecting pretrained models for finetuning, incorporating contrastive learning techniques, and culminating in an ensemble approach for the test set.
InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learning
Authors: Yan-Shuo Liang, Wu-Jun Li
Date: 2024-03-30 00:00:00
Proceeding: CVPR 2024 1
Tasks: Continual Learning, parameter-efficient fine-tuning

Continual learning requires the model to learn multiple tasks sequentially. In continual learning, the model should possess the ability to maintain its performance on old tasks (stability) and the ability to adapt to new tasks continuously (plasticity). Recently, parameter-efficient fine-tuning (PEFT), which involves freezing a pre-trained model and injecting a small number of learnable parameters to adapt to downstream tasks, has gained increasing popularity in continual learning. Although existing continual learning methods based on PEFT have demonstrated superior performance compared to those not based on PEFT, most of them do not consider how to eliminate the interference of the new task on the old tasks, which inhibits the model from making a good trade-off between stability and plasticity. In this work, we propose a new PEFT method, called interference-free low-rank adaptation (InfLoRA), for continual learning. InfLoRA injects a small number of parameters to reparameterize the pre-trained weights and shows that fine-tuning these injected parameters is equivalent to fine-tuning the pre-trained weights within a subspace. Furthermore, InfLoRA designs this subspace to eliminate the interference of the new task on the old tasks, making a good trade-off between stability and plasticity. Experimental results show that InfLoRA outperforms existing state-of-the-art continual learning methods on multiple datasets.
SGDFormer: One-stage Transformer-based Architecture for Cross-Spectral Stereo Image Guided Denoising
Authors: Runmin Zhang, Zhu Yu, Zehua Sheng, Jiacheng Ying, Si-Yuan Cao, Shu-Jie Chen, Bailin Yang, Junwei Li, Hui-Liang Shen
Date: 2024-03-30 00:00:00
Tasks: Denoising, Super-Resolution

Cross-spectral image guided denoising has shown its great potential in recovering clean images with rich details, such as using the near-infrared image to guide the denoising process of the visible one. To obtain such image pairs, a feasible and economical way is to employ a stereo system, which is widely used on mobile devices. Current works attempt to generate an aligned guidance image to handle the disparity between two images. However, due to occlusion, spectral differences and noise degradation, the aligned guidance image generally exists ghosting and artifacts, leading to an unsatisfactory denoised result. To address this issue, we propose a one-stage transformer-based architecture, named SGDFormer, for cross-spectral Stereo image Guided Denoising. The architecture integrates the correspondence modeling and feature fusion of stereo images into a unified network. Our transformer block contains a noise-robust cross-attention (NRCA) module and a spatially variant feature fusion (SVFF) module. The NRCA module captures the long-range correspondence of two images in a coarse-to-fine manner to alleviate the interference of noise. The SVFF module further enhances salient structures and suppresses harmful artifacts through dynamically selecting useful information. Thanks to the above design, our SGDFormer can restore artifact-free images with fine structures, and achieves state-of-the-art performance on various datasets. Additionally, our SGDFormer can be extended to handle other unaligned cross-model guided restoration tasks such as guided depth super-resolution.
DHR: Dual Features-Driven Hierarchical Rebalancing in Inter- and Intra-Class Regions for Weakly-Supervised Semantic Segmentation
Authors: Sanghyun Jo, Fei Pan, In-Jae Yu, KyungSu Kim
Date: 2024-03-30 00:00:00
Tasks: Segmentation, Semantic Segmentation, Weakly supervised Semantic Segmentation, Weakly-Supervised Semantic Segmentation

Weakly-supervised semantic segmentation (WSS) ensures high-quality segmentation with limited data and excels when employed as input seed masks for large-scale vision models such as Segment Anything. However, WSS faces challenges related to minor classes since those are overlooked in images with adjacent multiple classes, a limitation originating from the overfitting of traditional expansion methods like Random Walk. We first address this by employing unsupervised and weakly-supervised feature maps instead of conventional methodologies, allowing for hierarchical mask enhancement. This method distinctly categorizes higher-level classes and subsequently separates their associated lower-level classes, ensuring all classes are correctly restored in the mask without losing minor ones. Our approach, validated through extensive experimentation, significantly improves WSS across five benchmarks (VOC: 79.8\%, COCO: 53.9\%, Context: 49.0\%, ADE: 32.9\%, Stuff: 37.4\%), reducing the gap with fully supervised methods by over 84\% on the VOC validation set. Code is available at https://github.com/shjo-april/DHR.
Learning the mechanisms of network growth
Authors: Lourens Touwen, Doina Bucur, Remco van der Hofstad, Alessandro Garavaglia, Nelly Litvak
Date: 2024-03-31 00:00:00
Tasks: Graph Classification, Model Selection

We propose a novel model-selection method for dynamic networks. Our approach involves training a classifier on a large body of synthetic network data. The data is generated by simulating nine state-of-the-art random graph models for dynamic networks, with parameter range chosen to ensure exponential growth of the network size in time. We design a conceptually novel type of dynamic features that count new links received by a group of vertices in a particular time interval. The proposed features are easy to compute, analytically tractable, and interpretable. Our approach achieves a near-perfect classification of synthetic networks, exceeding the state-of-the-art by a large margin. Applying our classification method to real-world citation networks gives credibility to the claims in the literature that models with preferential attachment, fitness and aging fit real-world citation networks best, although sometimes, the predicted model does not involve vertex fitness.
Online Convex Optimization with Unbounded Memory
Authors: Raunak Kumar, Sarah Dean, Robert Kleinberg
Date: 2022-10-18 00:00:00
Proceeding: NeurIPS 2023 11

Online convex optimization (OCO) is a widely used framework in online learning. In each round, the learner chooses a decision in a convex set and an adversary chooses a convex loss function, and then the learner suffers the loss associated with their current decision. However, in many applications the learner's loss depends not only on the current decision but on the entire history of decisions until that point. The OCO framework and its existing generalizations do not capture this, and they can only be applied to many settings of interest after a long series of approximation arguments. They also leave open the question of whether the dependence on memory is tight because there are no non-trivial lower bounds. In this work we introduce a generalization of the OCO framework, "Online Convex Optimization with Unbounded Memory", that captures long-term dependence on past decisions. We introduce the notion of $p$-effective memory capacity, $H_p$, that quantifies the maximum influence of past decisions on present losses. We prove an $O(\sqrt{H_p T})$ upper bound on the policy regret and a matching (worst-case) lower bound. As a special case, we prove the first non-trivial lower bound for OCO with finite memory \citep{anavaHM2015online}, which could be of independent interest, and also improve existing upper bounds. We demonstrate the broad applicability of our framework by using it to derive regret bounds, and to improve and simplify existing regret bound derivations, for a variety of online learning problems including online linear control and an online variant of performative prediction.
Inference in Randomized Least Squares and PCA via Normality of Quadratic Forms
Authors: Leda Wang, Zhixiang Zhang, Edgar Dobriban
Date: 2024-04-01 00:00:00

Randomized algorithms can be used to speed up the analysis of large datasets. In this paper, we develop a unified methodology for statistical inference via randomized sketching or projections in two of the most fundamental problems in multivariate statistical analysis: least squares and PCA. The methodology applies to fixed datasets -- i.e., is data-conditional -- and the only randomness is due to the randomized algorithm. We propose statistical inference methods for a broad range of sketching distributions, such as the subsampled randomized Hadamard transform (SRHT), Sparse Sign Embeddings (SSE) and CountSketch, sketching matrices with i.i.d. entries, and uniform subsampling. To our knowledge, no comparable methods are available for SSE and for SRHT in PCA. Our novel theoretical approach rests on showing the asymptotic normality of certain quadratic forms. As a contribution of broader interest, we show central limit theorems for quadratic forms of the SRHT, relying on a novel proof via a dyadic expansion that leverages the recursive structure of the Hadamard transform. Numerical experiments using both synthetic and empirical datasets support the efficacy of our methods, and in particular suggest that sketching methods can have better computation-estimation tradeoffs than recently proposed optimal subsampling methods.