74,000 results on '"WANG, Hao"'
Search Results
2. Customized calibration sources in the JUNO experiment
- Author
-
Takenaka, Akira, Hui, Jiaqi, Li, Rui, Hao, Shuhua, Huang, Junting, Lai, Haojing, Li, Yuan, Liu, Jianglai, Meng, Yue, Qian, Zhicheng, Wang, Hao, Xiang, Ziqian, Yuan, Zhe, Yun, Youhui, Zhang, Feiyang, Zhang, Tao, and Zhang, Yuanyuan
- Subjects
Physics - Instrumentation and Detectors ,High Energy Physics - Experiment - Abstract
We customized a laser calibration system and four radioactive $\gamma$-ray calibration sources for the Jiangmen Underground Neutrino Observatory (JUNO), a 20-kton liquid scintillator-based neutrino detector. The laser source system was updated to realize the isotropic light emission timing within $\pm0.25$~nsec level and to allow the tuning of the laser intensity covering more than four orders of magnitude. In addition, methods to prepare four different radioactive sources ($^{18}{\rm F}$, $^{40}{\rm K}$, $^{226}{\rm Ra}$, and $^{241}{\rm Am}$), covering energies from O(10)~keV to O(1)~MeV, for the JUNO detector were established in this study. The radioactivity of each source and the risk of impurities leaking into the detector from the source were confirmed to meet the experimental requirements., Comment: 18 pages, 12 figures
- Published
- 2024
3. Loki: An Open-Source Tool for Fact Verification
- Author
-
Li, Haonan, Han, Xudong, Wang, Hao, Wang, Yuxia, Wang, Minghan, Xing, Rui, Geng, Yilin, Zhai, Zenan, Nakov, Preslav, and Baldwin, Timothy
- Subjects
Computer Science - Computation and Language - Abstract
We introduce Loki, an open-source tool designed to address the growing problem of misinformation. Loki adopts a human-centered approach, striking a balance between the quality of fact-checking and the cost of human involvement. It decomposes the fact-checking task into a five-step pipeline: breaking down long texts into individual claims, assessing their check-worthiness, generating queries, retrieving evidence, and verifying the claims. Instead of fully automating the claim verification process, Loki provides essential information at each step to assist human judgment, especially for general users such as journalists and content moderators. Moreover, it has been optimized for latency, robustness, and cost efficiency at a commercially usable level. Loki is released under an MIT license and is available on GitHub. We also provide a video presenting the system and its capabilities.
- Published
- 2024
4. DelayPTC-LLM: Metro Passenger Travel Choice Prediction under Train Delays with Large Language Models
- Author
-
Chen, Chen, He, Yuxin, Wang, Hao, Chen, Jingjing, and Luo, Qin
- Subjects
Computer Science - Machine Learning - Abstract
Train delays can propagate rapidly throughout the Urban Rail Transit (URT) network under networked operation conditions, posing significant challenges to operational departments. Accurately predicting passenger travel choices under train delays can provide interpretable insights into the redistribution of passenger flow, offering crucial decision support for emergency response and service recovery. However, the diversity of travel choices due to passenger heterogeneity and the sparsity of delay events leads to issues of data sparsity and sample imbalance in the travel choices dataset under metro delays. It is challenging to model this problem using traditional machine learning approaches, which typically rely on large, balanced datasets. Given the strengths of large language models (LLMs) in text processing, understanding, and their capabilities in small-sample and even zero-shot learning, this paper proposes a novel Passenger Travel Choice prediction framework under metro delays with the Large Language Model (DelayPTC-LLM). The well-designed prompting engineering is developed to guide the LLM in making and rationalizing predictions about travel choices, taking into account passenger heterogeneity and features of the delay events. Utilizing real-world data from Shenzhen Metro, including Automated Fare Collection (AFC) data and detailed delay logs, a comparative analysis of DelayPTC-LLM with traditional prediction models demonstrates the superior capability of LLMs in handling complex, sparse datasets commonly encountered under disruption of transportation systems. The results validate the advantages of DelayPTC-LLM in terms of predictive accuracy and its potential to provide actionable insights for big traffic data., Comment: 15 pages,4 figures
- Published
- 2024
5. Towards primordial gravitational waves and $n_s=1$ in light of BICEP/Keck, DESI BAO and Hubble tension
- Author
-
Wang, Hao, Ye, Gen, Jiang, Jun-Qian, and Piao, Yun-Song
- Subjects
Astrophysics - Cosmology and Nongalactic Astrophysics ,General Relativity and Quantum Cosmology - Abstract
Recent observational data seem to show a $\gtrsim 3\sigma$ evidence for an evolving dark energy (DE) against the cosmological constant, so the standard $\Lambda$CDM model. In this paper, we perform the search for the primordial gravitational waves with the potential pre-recombination solutions to the Hubble tension, using recent DESI baryon acoustic oscillation measurements combined with BICEP/Keck cosmic microwave background (CMB) B-mode polarization, Planck CMB and Pantheon supernova data, which reveal that the low bound of the tensor-to-scalar ratio $r$ is $> 1.5\sigma$ non-zero with the bestfit $r_{0.05}\sim 0.01$ and the scalar spectral index $n_s= 1$ (both $|r_{0.05}-0.01|$ and $|n_s-1|\sim {\cal O} (0.001)$). In particular, we observe the unnoticed impact of CMB B-mode polarization data for constraining the nature of DE, which together with early dark energy solutions to the Hubble tension is calling for the return of post-recombination $\Lambda$CDM., Comment: 15 pages, 3 figures
- Published
- 2024
6. A complete waveform comparison of post-Newtonian and numerical relativity in eccentric orbits
- Author
-
Wang, Hao, Zou, Yuan-Chuan, Wu, Qing-Wen, Liu, Xiaolin, and Li, Zhao
- Subjects
General Relativity and Quantum Cosmology - Abstract
This study presents a thorough comparative analysis between post-Newtonian (PN) and numerically relativistic (NR) waveforms in eccentric orbits, covering nonspinning and spin-aligned configurations. The comparison examines frequency, amplitude, and phase characteristics of various harmonic modes, such as 22, 21, 33, 32, 44, 43, and 55 modes. The study utilizes eccentric PN waveforms based on 3PN quasi-Keplerian parameterization with 3PN radiative reaction, surpassing Newtonian quadrupole moment with higher-order moments. NR waveforms from RIT and SXS catalogs span mass ratios from 1/4 to 1, eccentricities up to 0.45, and durations exceeding $17000M$ across nonspinning and spin-aligned configurations. Focusing on the 22 mode, frequency comparisons between quadrupole and higher-order moments of $\Psi_4^{22}$ and $h^{22}$ were conducted. Amplitude comparisons revealed superior accuracy in quadrupole moments of $\Psi_4^{22}$. Analysis of total 180 sets of eccentric waveforms showed increasing fitting residuals with rising eccentricity, correlating with smaller mass ratios. Comparisons of initial eccentricity from PN fitting, 3PN quasi-Keplerian parameterization, and RIT/SXS catalogs revealed alignment discrepancies. Frequency, phase, and amplitude comparisons of 22 modes showed consistent inspiral behavior between PN and NR, with divergences near merger for nonspinning PN and pre-200M for spin-aligned PN., Comment: Comments are very welcome and it have been submitted to PRD with 18 figures
- Published
- 2024
7. Asynchronous Fractional Multi-Agent Deep Reinforcement Learning for Age-Minimal Mobile Edge Computing
- Author
-
Jin, Lyudong, Tang, Ming, Pan, Jiayu, Zhang, Meng, and Wang, Hao
- Subjects
Computer Science - Machine Learning ,Computer Science - Networking and Internet Architecture - Abstract
In the realm of emerging real-time networked applications like cyber-physical systems (CPS), the Age of Information (AoI) has merged as a pivotal metric for evaluating the timeliness. To meet the high computational demands, such as those in intelligent manufacturing within CPS, mobile edge computing (MEC) presents a promising solution for optimizing computing and reducing AoI. In this work, we study the timeliness of computational-intensive updates and explores jointly optimize the task updating and offloading policies to minimize AoI. Specifically, we consider edge load dynamics and formulate a task scheduling problem to minimize the expected time-average AoI. The fractional objective introduced by AoI and the semi-Markov game nature of the problem render this challenge particularly difficult, with existing approaches not directly applicable. To this end, we present a comprehensive framework to fractional reinforcement learning (RL). We first introduce a fractional single-agent RL framework and prove its linear convergence. We then extend this to a fractional multi-agent RL framework with a convergence analysis. To tackle the challenge of asynchronous control in semi-Markov game, we further design an asynchronous model-free fractional multi-agent RL algorithm, where each device makes scheduling decisions with the hybrid action space without knowing the system dynamics and decisions of other devices. Experimental results show that our proposed algorithms reduce the average AoI by up to 52.6% compared with the best baseline algorithm in our experiments.
- Published
- 2024
8. An Adaptive Re-evaluation Method for Evolution Strategy under Additive Noise
- Author
-
Dinu, Catalin-Viorel, Patel, Yash J., Bonet-Monroig, Xavier, and Wang, Hao
- Subjects
Computer Science - Neural and Evolutionary Computing - Abstract
The Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES) is one of the most advanced algorithms in numerical black-box optimization. For noisy objective functions, several approaches were proposed to mitigate the noise, e.g., re-evaluations of the same solution or adapting the population size. In this paper, we devise a novel method to adaptively choose the optimal re-evaluation number for function values corrupted by additive Gaussian white noise. We derive a theoretical lower bound of the expected improvement achieved in one iteration of CMA-ES, given an estimation of the noise level and the Lipschitz constant of the function's gradient. Solving for the maximum of the lower bound, we obtain a simple expression of the optimal re-evaluation number. We experimentally compare our method to the state-of-the-art noise-handling methods for CMA-ES on a set of artificial test functions across various noise levels, optimization budgets, and dimensionality. Our method demonstrates significant advantages in terms of the probability of hitting near-optimal function values.
- Published
- 2024
9. Emotional Dimension Control in Language Model-Based Text-to-Speech: Spanning a Broad Spectrum of Human Emotions
- Author
-
Zhou, Kun, Zhang, You, Zhao, Shengkui, Wang, Hao, Pan, Zexu, Ng, Dianwen, Zhang, Chong, Ni, Chongjia, Ma, Yukun, Nguyen, Trung Hieu, Yip, Jia Qi, and Ma, Bin
- Subjects
Electrical Engineering and Systems Science - Audio and Speech Processing ,Computer Science - Computation and Language ,Computer Science - Sound - Abstract
Current emotional text-to-speech (TTS) systems face challenges in mimicking a broad spectrum of human emotions due to the inherent complexity of emotions and limitations in emotional speech datasets and models. This paper proposes a TTS framework that facilitates control over pleasure, arousal, and dominance, and can synthesize a diversity of emotional styles without requiring any emotional speech data during TTS training. We train an emotional attribute predictor using only categorical labels from speech data, aligning with psychological research and incorporating anchored dimensionality reduction on self-supervised learning (SSL) features. The TTS framework converts text inputs into phonetic tokens via an autoregressive language model and uses pseudo-emotional dimensions to guide the parallel prediction of fine-grained acoustic details. Experiments conducted on the LibriTTS dataset demonstrate that our framework can synthesize speech with enhanced naturalness and a variety of emotional styles by effectively controlling emotional dimensions, even without the inclusion of any emotional speech during TTS training., Comment: submitted to ICASSP 2025
- Published
- 2024
10. The signal synchronization function of myelin
- Author
-
Yu, Zhuonan, Qin, Peijun, Sun, Ruibing, Khademi, Sara, Xu, Zhen, Sun, Qinchao, Tai, Yanlong, Song, Bing, Guo, Tianruo, and Wang, Hao
- Subjects
Quantitative Biology - Neurons and Cognition ,Physics - Biological Physics - Abstract
The myelinated axons are widely present in both central and peripheral nervous systems. Its unique compact spiraling structure poses significant challenges to understanding its biological functions and developmental mechanisms. Conventionally, myelin is considered as an insulating layer to achieve saltatory conduction for the enhancement of the neural signal speed, which serves as the foundation of neuroscience. However, this insulating hypothesis is inadequate to account for various experimental observations, especially the long unmyelinated tract observed in the cortex. We here show non-random distributions in three ultrastructural features of myelin: the non-random spiraling directions, the localization preferences of myelin outer tongues, and the radial components along boundaries between oppositely spiraled myelin sheaths. These phenomena are predicted by a novel concept of myelin biological function, which we propose as the signal synchronization function. Our findings demonstrate that cytoplasmic channels within myelin may act as coiled inductors, facilitating electromagnetic induction between adjacent myelin sheaths, and thereby promoting signal synchronization between axons. This, in turn, explains the non-random ultrastructural features observed. We believe these insights lay the foundation for a new understanding of myelin inductive function.
- Published
- 2024
11. ChemEval: A Comprehensive Multi-Level Chemical Evaluation for Large Language Models
- Author
-
Huang, Yuqing, Zhang, Rongyang, He, Xuesong, Zhi, Xuyang, Wang, Hao, Li, Xin, Xu, Feiyang, Liu, Deguang, Liang, Huadong, Li, Yi, Cui, Jian, Liu, Zimu, Wang, Shijin, Hu, Guoping, Liu, Guiquan, Liu, Qi, Lian, Defu, and Chen, Enhong
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning ,Physics - Chemical Physics ,Quantitative Biology - Biomolecules - Abstract
There is a growing interest in the role that LLMs play in chemistry which lead to an increased focus on the development of LLMs benchmarks tailored to chemical domains to assess the performance of LLMs across a spectrum of chemical tasks varying in type and complexity. However, existing benchmarks in this domain fail to adequately meet the specific requirements of chemical research professionals. To this end, we propose \textbf{\textit{ChemEval}}, which provides a comprehensive assessment of the capabilities of LLMs across a wide range of chemical domain tasks. Specifically, ChemEval identified 4 crucial progressive levels in chemistry, assessing 12 dimensions of LLMs across 42 distinct chemical tasks which are informed by open-source data and the data meticulously crafted by chemical experts, ensuring that the tasks have practical value and can effectively evaluate the capabilities of LLMs. In the experiment, we evaluate 12 mainstream LLMs on ChemEval under zero-shot and few-shot learning contexts, which included carefully selected demonstration examples and carefully designed prompts. The results show that while general LLMs like GPT-4 and Claude-3.5 excel in literature understanding and instruction following, they fall short in tasks demanding advanced chemical knowledge. Conversely, specialized LLMs exhibit enhanced chemical competencies, albeit with reduced literary comprehension. This suggests that LLMs have significant potential for enhancement when tackling sophisticated tasks in the field of chemistry. We believe our work will facilitate the exploration of their potential to drive progress in chemistry. Our benchmark and analysis will be available at {\color{blue} \url{https://github.com/USTC-StarTeam/ChemEval}}.
- Published
- 2024
12. Skill-Adpative Imitation Learning for UI Test Reuse
- Author
-
Wu, Mengzhou, Wang, Hao, Ren, Jun, Cao, Yuan, Li, Yuetong, Jiang, Alex, Ran, Dezhi, Hu, Yitao, Yang, Wei, and Xie, Tao
- Subjects
Computer Science - Software Engineering - Abstract
To alleviate the substantial cost of manually crafting user interface (UI) test cases, UI test migration aims to automatically generate test cases for a target mobile application (app) by adapting those from a source app that shares similar functionalities. Traditionally, this process has been approached as a sequential UI-event-mapping problem, where events in the source app are mapped to those in the target one based on their textual descriptions. Prior research has extensively focused on enhancing the event-mapping accuracy of NLP models. Although the advent of large language models (LLMs) with impressive NLP capabilities suggests the potential for near-perfect event-mapping, our study demonstrates that even the highly accurate event-mapping of LLMs is insufficient to address the implementation discrepancies between the source and the target apps, reducing the overall effectiveness of LLM-driven solutions for UI test migration. To address this challenge, in this paper, we propose SAIL, a skill-adaptive imitation learning framework designed to enhance the effectiveness of UI test migration through two key designs. First, SAIL leverages the source test cases as demonstrations and employs a multi-level abstraction of test cases' underlying skills, so as to extract the testing information from source test cases as the knowledge base for the subsequent test generation on the target app. Second, SAIL selectively reuses a subset of the learned skills to guide the generation of test cases for the target app with its novel context- and history-aware skill adaptation. While SAIL can be instantiated with any imitation learning techniques, we utilize the in-context learning capabilities of LLMs to instantiate SAIL. Evaluations results show that SAIL substantially improves the effectiveness of UI test migration, with 149\% higher success rate than state-of-the-art approaches.
- Published
- 2024
13. EmotionQueen: A Benchmark for Evaluating Empathy of Large Language Models
- Author
-
Chen, Yuyan, Wang, Hao, Yan, Songzhou, Liu, Sijia, Li, Yueze, Zhao, Yi, and Xiao, Yanghua
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Emotional intelligence in large language models (LLMs) is of great importance in Natural Language Processing. However, the previous research mainly focus on basic sentiment analysis tasks, such as emotion recognition, which is not enough to evaluate LLMs' overall emotional intelligence. Therefore, this paper presents a novel framework named EmotionQueen for evaluating the emotional intelligence of LLMs. The framework includes four distinctive tasks: Key Event Recognition, Mixed Event Recognition, Implicit Emotional Recognition, and Intention Recognition. LLMs are requested to recognize important event or implicit emotions and generate empathetic response. We also design two metrics to evaluate LLMs' capabilities in recognition and response for emotion-related statements. Experiments yield significant conclusions about LLMs' capabilities and limitations in emotion intelligence., Comment: Accepted to ACL 2024 (Findings)
- Published
- 2024
14. D2Vformer: A Flexible Time Series Prediction Model Based on Time Position Embedding
- Author
-
Song, Xiaobao, Wang, Hao, Deng, Liwei, He, Yuxin, Cao, Wenming, and Leungc, Chi-Sing
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Time position embeddings capture the positional information of time steps, often serving as auxiliary inputs to enhance the predictive capabilities of time series models. However, existing models exhibit limitations in capturing intricate time positional information and effectively utilizing these embeddings. To address these limitations, this paper proposes a novel model called D2Vformer. Unlike typical prediction methods that rely on RNNs or Transformers, this approach can directly handle scenarios where the predicted sequence is not adjacent to the input sequence or where its length dynamically changes. In comparison to conventional methods, D2Vformer undoubtedly saves a significant amount of training resources. In D2Vformer, the Date2Vec module uses the timestamp information and feature sequences to generate time position embeddings. Afterward, D2Vformer introduces a new fusion block that utilizes an attention mechanism to explore the similarity in time positions between the embeddings of the input sequence and the predicted sequence, thereby generating predictions based on this similarity. Through extensive experiments on six datasets, we demonstrate that Date2Vec outperforms other time position embedding methods, and D2Vformer surpasses state-of-the-art methods in both fixed-length and variable-length prediction tasks.
- Published
- 2024
15. Multi-Floor Zero-Shot Object Navigation Policy
- Author
-
Zhang, Lingfeng, Wang, Hao, Xiao, Erjia, Zhang, Xinyao, Zhang, Qiang, Jiang, Zixuan, and Xu, Renjing
- Subjects
Computer Science - Robotics - Abstract
Object navigation in multi-floor environments presents a formidable challenge in robotics, requiring sophisticated spatial reasoning and adaptive exploration strategies. Traditional approaches have primarily focused on single-floor scenarios, overlooking the complexities introduced by multi-floor structures. To address these challenges, we first propose a Multi-floor Navigation Policy (MFNP) and implement it in Zero-Shot object navigation tasks. Our framework comprises three key components: (i) Multi-floor Navigation Policy, which enables an agent to explore across multiple floors; (ii) Multi-modal Large Language Models (MLLMs) for reasoning in the navigation process; and (iii) Inter-Floor Navigation, ensuring efficient floor transitions. We evaluate MFNP on the Habitat-Matterport 3D (HM3D) and Matterport 3D (MP3D) datasets, both include multi-floor scenes. Our experiment results demonstrate that MFNP significantly outperforms all the existing methods in Zero-Shot object navigation, achieving higher success rates and improved exploration efficiency. Ablation studies further highlight the effectiveness of each component in addressing the unique challenges of multi-floor navigation. Meanwhile, we conducted real-world experiments to evaluate the feasibility of our policy. Upon deployment of MFNP, the Unitree quadruped robot demonstrated successful multi-floor navigation and found the target object in a completely unseen environment. By introducing MFNP, we offer a new paradigm for tackling complex, multi-floor environments in object navigation tasks, opening avenues for future research in visual-based navigation in realistic, multi-floor settings.
- Published
- 2024
16. Probing dimension-8 SMEFT operators through neutral meson mixing
- Author
-
Liao, Yi, Ma, Xiao-Dong, and Wang, Hao-Lin
- Subjects
High Energy Physics - Phenomenology - Abstract
We investigate the impact of effective interactions of dimension-8 (dim-8) operators in the standard model effective field theory (SMEFT) on neutral meson mixing, focusing on the $K^0-\bar K^0$, $B_{d,s}-\bar B_{d,s}$, and $D^0-\bar D^0$ systems. Within the framework of the low energy effective field theory (LEFT), each system is governed by eight dim-6 operators, with four originating at tree level from dim-6 SMEFT operators and the other four from dim-8 SMEFT operators. Notably, in certain UV complete models those dim-8 operators instead of the dim-6 ones are generated at the leading order. Our analysis focuses on those dim-8 operators and includes their one-loop QCD renormalization group running effects. By leveraging the LEFT master formula we impose stringent constraints on the effective scales associated with these dim-8 operators. We find that neutral meson mixing can probe an effective scale up to 50 TeV for some operators, surpassing the constraints imposed on other dim-8 operators by other observables. Lastly, we present a UV complete model capable of generating dim-8 operators at the leading order, thus offering a unique perspective on the interplay between different operator dimensions in probing new physics phenomena., Comment: 20 pages, 4 figures
- Published
- 2024
17. Cooptimizing Safety and Performance with a Control-Constrained Formulation
- Author
-
Wang, Hao, Dhande, Adityaya, and Bansal, Somil
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Robotics - Abstract
Autonomous systems have witnessed a rapid increase in their capabilities, but it remains a challenge for them to perform tasks both effectively and safely. The fact that performance and safety can sometimes be competing objectives renders the cooptimization between them difficult. One school of thought is to treat this cooptimization as a constrained optimal control problem with a performance-oriented objective function and safety as a constraint. However, solving this constrained optimal control problem for general nonlinear systems remains challenging. In this work, we use the general framework of constrained optimal control, but given the safety state constraint, we convert it into an equivalent control constraint, resulting in a state and time-dependent control-constrained optimal control problem. This equivalent optimal control problem can readily be solved using the dynamic programming principle. We show the corresponding value function is a viscosity solution of a certain Hamilton-Jacobi-Bellman Partial Differential Equation (HJB-PDE). Furthermore, we demonstrate the effectiveness of our method with a two-dimensional case study, and the experiment shows that the controller synthesized using our method consistently outperforms the baselines, both in safety and performance., Comment: Submitted to ACC with L-CSS option
- Published
- 2024
18. Multi-Weather Image Restoration via Histogram-Based Transformer Feature Enhancement
- Author
-
Wen, Yang, Lai, Anyu, Qian, Bo, Wang, Hao, Shi, Wuzhen, and Cao, Wenming
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Currently, the mainstream restoration tasks under adverse weather conditions have predominantly focused on single-weather scenarios. However, in reality, multiple weather conditions always coexist and their degree of mixing is usually unknown. Under such complex and diverse weather conditions, single-weather restoration models struggle to meet practical demands. This is particularly critical in fields such as autonomous driving, where there is an urgent need for a model capable of effectively handling mixed weather conditions and enhancing image quality in an automated manner. In this paper, we propose a Task Sequence Generator module that, in conjunction with the Task Intra-patch Block, effectively extracts task-specific features embedded in degraded images. The Task Intra-patch Block introduces an external learnable sequence that aids the network in capturing task-specific information. Additionally, we employ a histogram-based transformer module as the backbone of our network, enabling the capture of both global and local dynamic range features. Our proposed model achieves state-of-the-art performance on public datasets., Comment: arXiv admin note: text overlap with arXiv:2409.03249
- Published
- 2024
19. Zeroshot Listwise Learning to Rank Algorithm for Recommendation
- Author
-
Wang, Hao
- Subjects
Computer Science - Information Retrieval - Abstract
Learning to rank is a rare technology compared with other techniques such as deep neural networks. The number of experts in the field is roughly 1/6 of the number of professionals in deep learning. Being an effective ranking methodology, learning to rank has been widely used in the field of information retrieval. However, in recent years, learning to rank as a recommendation approach has been on decline. In this paper, we take full advantage of order statistic approximation and power law distribution to design a zeroshot listwise learning to rank algorithm for recommendation. We prove in the experiment section that our approach is both accurate and fair.
- Published
- 2024
- Full Text
- View/download PDF
20. Multiple weather images restoration using the task transformer and adaptive mixup strategy
- Author
-
Wen, Yang, Lai, Anyu, Qian, Bo, Wang, Hao, Shi, Wuzhen, and Cao, Wenming
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
The current state-of-the-art in severe weather removal predominantly focuses on single-task applications, such as rain removal, haze removal, and snow removal. However, real-world weather conditions often consist of a mixture of several weather types, and the degree of weather mixing in autonomous driving scenarios remains unknown. In the presence of complex and diverse weather conditions, a single weather removal model often encounters challenges in producing clear images from severe weather images. Therefore, there is a need for the development of multi-task severe weather removal models that can effectively handle mixed weather conditions and improve image quality in autonomous driving scenarios. In this paper, we introduce a novel multi-task severe weather removal model that can effectively handle complex weather conditions in an adaptive manner. Our model incorporates a weather task sequence generator, enabling the self-attention mechanism to selectively focus on features specific to different weather types. To tackle the challenge of repairing large areas of weather degradation, we introduce Fast Fourier Convolution (FFC) to increase the receptive field. Additionally, we propose an adaptive upsampling technique that effectively processes both the weather task information and underlying image features by selectively retaining relevant information. Our proposed model has achieved state-of-the-art performance on the publicly available dataset., Comment: 10 pages, 5 figures and 2 table
- Published
- 2024
21. Searching for MeV-scale Axion-like Particles and Dark Photons with PandaX-4T
- Author
-
PandaX Collaboration, Li, Tao, Bo, Zihao, Chen, Wei, Chen, Xun, Chen, Yunhua, Cheng, Zhaokan, Cui, Xiangyi, Fan, Yingjie, Fang, Deqing, Gao, Zhixing, Geng, Lisheng, Giboni, Karl, Guo, Xunan, Guo, Xuyuan, Guo, Zichao, Han, Chencheng, He, Ke HanChangda, He, Jinrong, Huang, Di, Huang, Houqi, Huang, Junting, Hou, Ruquan, Hou, Yu, Ji, Xiangdong, Ji, Xiangpan, Ju, Yonglin, Li, Chenxiang, Li, Jiafu, Li, Mingchuan, Li, Shuaijie, Li, Zhiyuan, Lin, Qing, Liu, Jianglai, Lu, Congcong, Lu, Xiaoying, Luo, Lingyin, Luo, Yunyang, Ma, Wenbo, Ma, Yugang, Mao, Yajun, Meng, Yue, Ning, Xuyang, Pang, Binyu, Qi, Ningchun, Qian, Zhicheng, Ren, Xiangxiang, Shan, Dong, Shang, Xiaofeng, Shao, Xiyuan, Shen, Guofang, Shen, Manbin, Sun, Wenliang, Tao, Yi, Wang, Anqing, Wang, Guanbo, Wang, Hao, Wang, Jiamin, Wang, Lei, Wang, Meng, Wang, Qiuhong, Wang, Shaobo, Wang, Siguang, Wang, Wei, Wang, Xiuli, Wang, Xu, Wang, Zhou, Wei, Yuehuan, Wu, Weihao, Wu, Yuan, Xiao, Mengjiao, Xiao, Xiang, Xiong, Kaizhi, Xu, Yifan, Yao, Shunyu, Yan, Binbin, Yan, Xiyu, Yang, Yong, Ye, Peihua, Yu, Chunxu, Yuan, Ying, Yuan, Zhe, Yun, Youhui, Zeng, Xinning, Zhang, Minzhen, Zhang, Peng, Zhang, Shibo, Zhang, Shu, Zhang, Tao, Zhang, Wei, Zhang, Yang, Zhang, Yingxin, Zhang, Yuanyuan, Zhao, Li, Zhou, Jifang, Zhou, Jiaxu, Zhou, Jiayi, Zhou, Ning, Zhou, Xiaopeng, Zhou, Yubo, and Zhou, Zhizhen
- Subjects
High Energy Physics - Experiment - Abstract
Axion-like particles (ALPs) and dark photons (DPs) are viable dark matter particle candidates. We have searched for possible ALP/DP signals in the PandaX-4T liquid xenon detector using 94.8 days of data. A binned likelihood fit is constructed to search for possible mono-energetic peaks induced by the absorption processes between ALPs/DPs and atomic electrons of xenon. A detailed temporal model of decays associated with xenon isotopes is introduced to constrain the number of background events. No signal excess over background expectations is observed, and we have established the most stringent exclusion limits for most ALP/DP masses ranging from 150 keV/$c^2$ to 1 MeV/$c^2$.
- Published
- 2024
22. Interference-Cancellation-Based Channel Knowledge Map Construction and Its Applications to Channel Estimation
- Author
-
Jiang, Wenjun, Yuan, Xiaojun, Teng, Boyu, Wang, Hao, and Qian, Jing
- Subjects
Computer Science - Information Theory - Abstract
Channel knowledge map (CKM) is viewed as a digital twin of wireless channels, providing location-specific channel knowledge for environment-aware communications. A fundamental problem in CKM-assisted communications is how to construct the CKM efficiently. Current research focuses on interpolating or predicting channel knowledge based on error-free channel knowledge from measured regions, ignoring the extraction of channel knowledge. This paper addresses this gap by unifying the extraction and representation of channel knowledge. We propose a novel CKM construction framework that leverages the received signals of the base station (BS) as online and low-cost data. Specifically, we partition the BS coverage area into spatial grids. The channel knowledge per grid is represented by a set of multi-path powers, delays, and angles, based on the principle of spatial consistency. In the extraction of these channel parameters, the challenges lie in strong inter-cell interferences and non-linear relationship between received signals and channel parameters. To address these issues, we formulate the problem of CKM construction into a problem of Bayesian inference, employing a block-sparsity prior model to characterize the path-loss differences of interferers. Under the Bayesian inference framework, we develop a hybrid message-passing algorithm for the interference-cancellation-based CKM construction. Based on the CKM, we obtain the joint frequency-space covariance of user channel and design a CKM-assisted Bayesian channel estimator. The computational complexity of the channel estimator is substantially reduced by exploiting the CKM-derived covariance structure. Numerical results show that the proposed CKM provides accurate channel parameters at low signal-to-interference-plus-noise ratio (SINR) and that the CKM-assisted channel estimator significantly outperforms state-of-the-art counterparts.
- Published
- 2024
23. Bridging User Dynamics: Transforming Sequential Recommendations with Schr\'odinger Bridge and Diffusion Models
- Author
-
Xie, Wenjia, Zhou, Rui, Wang, Hao, Shen, Tingjia, and Chen, Enhong
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
Sequential recommendation has attracted increasing attention due to its ability to accurately capture the dynamic changes in user interests. We have noticed that generative models, especially diffusion models, which have achieved significant results in fields like image and audio, hold considerable promise in the field of sequential recommendation. However, existing sequential recommendation methods based on diffusion models are constrained by a prior distribution limited to Gaussian distribution, hindering the possibility of introducing user-specific information for each recommendation and leading to information loss. To address these issues, we introduce the Schr\"odinger Bridge into diffusion-based sequential recommendation models, creating the SdifRec model. This allows us to replace the Gaussian prior of the diffusion model with the user's current state, directly modeling the process from a user's current state to the target recommendation. Additionally, to better utilize collaborative information in recommendations, we propose an extended version of SdifRec called con-SdifRec, which utilizes user clustering information as a guiding condition to further enhance the posterior distribution. Finally, extensive experiments on multiple public benchmark datasets have demonstrated the effectiveness of SdifRec and con-SdifRec through comparison with several state-of-the-art methods. Further in-depth analysis has validated their efficiency and robustness., Comment: CIKM '24
- Published
- 2024
24. Language Model Empowered Spatio-Temporal Forecasting via Physics-Aware Reprogramming
- Author
-
Wang, Hao, Han, Jindong, Fan, Wei, and Liu, Hao
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
Spatio-temporal forecasting is pivotal in numerous real-world applications, including transportation planning, energy management, and climate monitoring. In this work, we aim to harness the reasoning and generalization abilities of Pre-trained Language Models (PLMs) for more effective spatio-temporal forecasting, particularly in data-scarce scenarios. However, recent studies uncover that PLMs, which are primarily trained on textual data, often falter when tasked with modeling the intricate correlations in numerical time series, thereby limiting their effectiveness in comprehending spatio-temporal data. To bridge the gap, we propose RePST, a physics-aware PLM reprogramming framework tailored for spatio-temporal forecasting. Specifically, we first propose a physics-aware decomposer that adaptively disentangles spatially correlated time series into interpretable sub-components, which facilitates PLM to understand sophisticated spatio-temporal dynamics via a divide-and-conquer strategy. Moreover, we propose a selective discrete reprogramming scheme, which introduces an expanded spatio-temporal vocabulary space to project spatio-temporal series into discrete representations. This scheme minimizes the information loss during reprogramming and enriches the representations derived by PLMs. Extensive experiments on real-world datasets show that the proposed RePST outperforms twelve state-of-the-art baseline methods, particularly in data-scarce scenarios, highlighting the effectiveness and superior generalization capabilities of PLMs for spatio-temporal forecasting.
- Published
- 2024
25. Denoising Pre-Training and Customized Prompt Learning for Efficient Multi-Behavior Sequential Recommendation
- Author
-
Wang, Hao, Han, Yongqiang, Wang, Kefan, Cheng, Kai, Wang, Zhen, Guo, Wei, Liu, Yong, Lian, Defu, and Chen, Enhong
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence - Abstract
In the realm of recommendation systems, users exhibit a diverse array of behaviors when interacting with items. This phenomenon has spurred research into learning the implicit semantic relationships between these behaviors to enhance recommendation performance. However, these methods often entail high computational complexity. To address concerns regarding efficiency, pre-training presents a viable solution. Its objective is to extract knowledge from extensive pre-training data and fine-tune the model for downstream tasks. Nevertheless, previous pre-training methods have primarily focused on single-behavior data, while multi-behavior data contains significant noise. Additionally, the fully fine-tuning strategy adopted by these methods still imposes a considerable computational burden. In response to this challenge, we propose DPCPL, the first pre-training and prompt-tuning paradigm tailored for Multi-Behavior Sequential Recommendation. Specifically, in the pre-training stage, we commence by proposing a novel Efficient Behavior Miner (EBM) to filter out the noise at multiple time scales, thereby facilitating the comprehension of the contextual semantics of multi-behavior sequences. Subsequently, we propose to tune the pre-trained model in a highly efficient manner with the proposed Customized Prompt Learning (CPL) module, which generates personalized, progressive, and diverse prompts to fully exploit the potential of the pre-trained model effectively. Extensive experiments on three real-world datasets have unequivocally demonstrated that DPCPL not only exhibits high efficiency and effectiveness, requiring minimal parameter adjustments but also surpasses the state-of-the-art performance across a diverse range of downstream tasks.
- Published
- 2024
26. SG-GS: Photo-realistic Animatable Human Avatars with Semantically-Guided Gaussian Splatting
- Author
-
Zhao, Haoyu, Yang, Chen, Wang, Hao, Zhao, Xingyue, and Shen, Wei
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Reconstructing photo-realistic animatable human avatars from monocular videos remains challenging in computer vision and graphics. Recently, methods using 3D Gaussians to represent the human body have emerged, offering faster optimization and real-time rendering. However, due to ignoring the crucial role of human body semantic information which represents the intrinsic structure and connections within the human body, they fail to achieve fine-detail reconstruction of dynamic human avatars. To address this issue, we propose SG-GS, which uses semantics-embedded 3D Gaussians, skeleton-driven rigid deformation, and non-rigid cloth dynamics deformation to create photo-realistic animatable human avatars from monocular videos. We then design a Semantic Human-Body Annotator (SHA) which utilizes SMPL's semantic prior for efficient body part semantic labeling. The generated labels are used to guide the optimization of Gaussian semantic attributes. To address the limited receptive field of point-level MLPs for local features, we also propose a 3D network that integrates geometric and semantic associations for human avatar deformation. We further implement three key strategies to enhance the semantic accuracy of 3D Gaussians and rendering quality: semantic projection with 2D regularization, semantic-guided density regularization and semantic-aware regularization with neighborhood consistency. Extensive experiments demonstrate that SG-GS achieves state-of-the-art geometry and appearance reconstruction performance., Comment: 12 pages, 5 figures
- Published
- 2024
27. CHASE: 3D-Consistent Human Avatars with Sparse Inputs via Gaussian Splatting and Contrastive Learning
- Author
-
Zhao, Haoyu, Wang, Hao, Yang, Chen, and Shen, Wei
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Recent advancements in human avatar synthesis have utilized radiance fields to reconstruct photo-realistic animatable human avatars. However, both NeRFs-based and 3DGS-based methods struggle with maintaining 3D consistency and exhibit suboptimal detail reconstruction, especially with sparse inputs. To address this challenge, we propose CHASE, which introduces supervision from intrinsic 3D consistency across poses and 3D geometry contrastive learning, achieving performance comparable with sparse inputs to that with full inputs. Following previous work, we first integrate a skeleton-driven rigid deformation and a non-rigid cloth dynamics deformation to coordinate the movements of individual Gaussians during animation, reconstructing basic avatar with coarse 3D consistency. To improve 3D consistency under sparse inputs, we design Dynamic Avatar Adjustment(DAA) to adjust deformed Gaussians based on a selected similar pose/image from the dataset. Minimizing the difference between the image rendered by adjusted Gaussians and the image with the similar pose serves as an additional form of supervision for avatar. Furthermore, we propose a 3D geometry contrastive learning strategy to maintain the 3D global consistency of generated avatars. Though CHASE is designed for sparse inputs, it surprisingly outperforms current SOTA methods \textbf{in both full and sparse settings} on the ZJU-MoCap and H36M datasets, demonstrating that our CHASE successfully maintains avatar's 3D consistency, hence improving rendering quality., Comment: 13 pages, 6 figures
- Published
- 2024
28. Exploring New Physics with PandaX-4T Low Energy Electronic Recoil Data
- Author
-
PandaX Collaboration, Zeng, Xinning, Bo, Zihao, Chen, Wei, Chen, Xun, Chen, Yunhua, Cheng, Zhaokan, Cui, Xiangyi, Fan, Yingjie, Fang, Deqing, Gao, Zhixing, Geng, Lisheng, Giboni, Karl, Guo, Xunan, Guo, Xuyuan, Guo, Zichao, Han, Chencheng, He, Ke HanChangda, He, Jinrong, Huang, Di, Huang, Houqi, Huang, Junting, Hou, Ruquan, Hou, Yu, Ji, Xiangdong, Ji, Xiangpan, Ju, Yonglin, Li, Chenxiang, Li, Jiafu, Li, Mingchuan, Li, Shuaijie, Li, Tao, Li, Zhiyuan, Lin, Qing, Liu, Jianglai, Lu, Congcong, Lu, Xiaoying, Luo, Lingyin, Luo, Yunyang, Ma, Wenbo, Ma, Yugang, Mao, Yajun, Meng, Yue, Ning, Xuyang, Pang, Binyu, Qi, Ningchun, Qian, Zhicheng, Ren, Xiangxiang, Shan, Dong, Shang, Xiaofeng, Shao, Xiyuan, Shen, Guofang, Shen, Manbin, Sun, Wenliang, Tao, Yi, Wang, Anqing, Wang, Guanbo, Wang, Hao, Wang, Jiamin, Wang, Lei, Wang, Meng, Wang, Qiuhong, Wang, Shaobo, Wang, Siguang, Wang, Wei, Wang, Xiuli, Wang, Xu, Wang, Zhou, Wei, Yuehuan, Wu, Weihao, Wu, Yuan, Xiao, Mengjiao, Xiao, Xiang, Xiong, Kaizhi, Xu, Yifan, Yao, Shunyu, Yan, Binbin, Yan, Xiyu, Yang, Yong, Ye, Peihua, Yu, Chunxu, Yuan, Ying, Yuan, Zhe, Yun, Youhui, Zhang, Minzhen, Zhang, Peng, Zhang, Shibo, Zhang, Shu, Zhang, Tao, Zhang, Wei, Zhang, Yang, Zhang, Yingxin, Zhang, Yuanyuan, Zhao, Li, Zhou, Jifang, Zhou, Jiaxu, Zhou, Jiayi, Zhou, Ning, Zhou, Xiaopeng, Zhou, Yubo, and Zhou, Zhizhen
- Subjects
High Energy Physics - Experiment - Abstract
New particles beyond the Standard Model of particle physics, such as axions, can be effectively searched through their interactions with electrons. We use the large liquid xenon detector PandaX-4T to search for novel electronic recoil signals induced by solar axions, neutrinos with anomalous magnetic moment, axion-like particles, dark photons, and light fermionic dark matter. A detailed background model is established with the latest datasets with 1.54 $\rm tonne \cdot year$ exposure. No significant excess above the background has been observed, and we have obtained competitive constraints for axion couplings, neutrino magnetic moment, and fermionic dark matter interactions.
- Published
- 2024
29. Voltran: Unlocking Trust and Confidentiality in Decentralized Federated Learning Aggregation
- Author
-
Wang, Hao, Cai, Yichen, Wang, Jun, Ma, Chuan, Ge, Chunpeng, Qu, Xiangmou, and Zhou, Lu
- Subjects
Computer Science - Cryptography and Security - Abstract
The decentralized Federated Learning (FL) paradigm built upon blockchain architectures leverages distributed node clusters to replace the single server for executing FL model aggregation. This paradigm tackles the vulnerability of the centralized malicious server in vanilla FL and inherits the trustfulness and robustness offered by blockchain. However, existing blockchain-enabled schemes face challenges related to inadequate confidentiality on models and limited computational resources of blockchains to perform large-scale FL computations. In this paper, we present Voltran, an innovative hybrid platform designed to achieve trust, confidentiality, and robustness for FL based on the combination of the Trusted Execution Environment (TEE) and blockchain technology. We offload the FL aggregation computation into TEE to provide an isolated, trusted and customizable off-chain execution, and then guarantee the authenticity and verifiability of aggregation results on the blockchain. Moreover, we provide strong scalability on multiple FL scenarios by introducing a multi-SGX parallel execution strategy to amortize the large-scale FL workload. We implement a prototype of Voltran and conduct a comprehensive performance evaluation. Extensive experimental results demonstrate that Voltran incurs minimal additional overhead while guaranteeing trust, confidentiality, and authenticity, and it significantly brings a significant speed-up compared to state-of-the-art ciphertext aggregation schemes.
- Published
- 2024
30. ViC: Virtual Compiler Is All You Need For Assembly Code Search
- Author
-
Gao, Zeyu, Wang, Hao, Wang, Yuanda, and Zhang, Chao
- Subjects
Computer Science - Software Engineering ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
Assembly code search is vital for reducing the burden on reverse engineers, allowing them to quickly identify specific functions using natural language within vast binary programs. Despite its significance, this critical task is impeded by the complexities involved in building high-quality datasets. This paper explores training a Large Language Model (LLM) to emulate a general compiler. By leveraging Ubuntu packages to compile a dataset of 20 billion tokens, we further continue pre-train CodeLlama as a Virtual Compiler (ViC), capable of compiling any source code of any language to assembly code. This approach allows for virtual compilation across a wide range of programming languages without the need for a real compiler, preserving semantic equivalency and expanding the possibilities for assembly code dataset construction. Furthermore, we use ViC to construct a sufficiently large dataset for assembly code search. Employing this extensive dataset, we achieve a substantial improvement in assembly code search performance, with our model surpassing the leading baseline by 26%.
- Published
- 2024
31. Online Electric Vehicle Charging Detection Based on Memory-based Transformer using Smart Meter Data
- Author
-
Kamoona, Ammar Mansoor, Song, Hui, Jalili, Mahdi, Wang, Hao, Razzaghi, Reza, and Yu, Xinghuo
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
The growing popularity of Electric Vehicles (EVs) poses unique challenges for grid operators and infrastructure, which requires effectively managing these vehicles' integration into the grid. Identification of EVs charging is essential to electricity Distribution Network Operators (DNOs) for better planning and managing the distribution grid. One critical aspect is the ability to accurately identify the presence of EV charging in the grid. EV charging identification using smart meter readings obtained from behind-the-meter devices is a challenging task that enables effective managing the integration of EVs into the existing power grid. Different from the existing supervised models that require addressing the imbalance problem caused by EVs and non-EVs data, we propose a novel unsupervised memory-based transformer (M-TR) that can run in real-time (online) to detect EVs charging from a streaming smart meter. It dynamically leverages coarse-scale historical information using an M-TR encoder from an extended global temporal window, in conjunction with an M-TR decoder that concentrates on a limited time frame, local window, aiming to capture the fine-scale characteristics of the smart meter data. The M-TR is based on an anomaly detection technique that does not require any prior knowledge about EVs charging profiles, nor it does only require real power consumption data of non-EV users. In addition, the proposed model leverages the power of transfer learning. The M-TR is compared with different state-of-the-art methods and performs better than other unsupervised learning models. The model can run with an excellent execution time of 1.2 sec. for 1-minute smart recordings.
- Published
- 2024
32. HARMONIC: Harnessing LLMs for Tabular Data Synthesis and Privacy Protection
- Author
-
Wang, Yuxin, Feng, Duanyu, Dai, Yongfu, Chen, Zhengyu, Huang, Jimin, Ananiadou, Sophia, Xie, Qianqian, and Wang, Hao
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Cryptography and Security - Abstract
Data serves as the fundamental foundation for advancing deep learning, particularly tabular data presented in a structured format, which is highly conducive to modeling. However, even in the era of LLM, obtaining tabular data from sensitive domains remains a challenge due to privacy or copyright concerns. Hence, exploring how to effectively use models like LLMs to generate realistic and privacy-preserving synthetic tabular data is urgent. In this paper, we take a step forward to explore LLMs for tabular data synthesis and privacy protection, by introducing a new framework HARMONIC for tabular data generation and evaluation. In the tabular data generation of our framework, unlike previous small-scale LLM-based methods that rely on continued pre-training, we explore the larger-scale LLMs with fine-tuning to generate tabular data and enhance privacy. Based on idea of the k-nearest neighbors algorithm, an instruction fine-tuning dataset is constructed to inspire LLMs to discover inter-row relationships. Then, with fine-tuning, LLMs are trained to remember the format and connections of the data rather than the data itself, which reduces the risk of privacy leakage. In the evaluation part of our framework, we develop specific privacy risk metrics DLT for LLM synthetic data generation, as well as performance evaluation metrics LLE for downstream LLM tasks. Our experiments find that this tabular data generation framework achieves equivalent performance to existing methods with better privacy, which also demonstrates our evaluation framework for the effectiveness of synthetic data and privacy risks in LLM scenarios.
- Published
- 2024
33. Dark Matter Search Results from 1.54 Tonne$\cdot$Year Exposure of PandaX-4T
- Author
-
PandaX Collaboration, Bo, Zihao, Chen, Wei, Chen, Xun, Chen, Yunhua, Cheng, Zhaokan, Cui, Xiangyi, Fan, Yingjie, Fang, Deqing, Gao, Zhixing, Geng, Lisheng, Giboni, Karl, Guo, Xunan, Guo, Xuyuan, Guo, Zichao, Han, Chencheng, Han, Ke, He, Changda, He, Jinrong, Huang, Di, Huang, Houqi, Huang, Junting, Hou, Ruquan, Hou, Yu, Ji, Xiangdong, Ji, Xiangpan, Ju, Yonglin, Li, Chenxiang, Li, Jiafu, Li, Mingchuan, Li, Shuaijie, Li, Tao, Li, Zhiyuan, Lin, Qing, Liu, Jianglai, Lu, Congcong, Lu, Xiaoying, Luo, Lingyin, Luo, Yunyang, Ma, Wenbo, Ma, Yugang, Mao, Yajun, Meng, Yue, Ning, Xuyang, Pang, Binyu, Qi, Ningchun, Qian, Zhicheng, Ren, Xiangxiang, Shan, Dong, Shang, Xiaofeng, Shao, Xiyuan, Shen, Guofang, Shen, Manbin, Sun, Wenliang, Tao, Yi, Wang, Anqing, Wang, Guanbo, Wang, Hao, Wang, Jiamin, Wang, Lei, Wang, Meng, Wang, Qiuhong, Wang, Shaobo, Wang, Siguang, Wang, Wei, Wang, Xiuli, Wang, Xu, Wang, Zhou, Wei, Yuehuan, Wu, Weihao, Wu, Yuan, Xiao, Mengjiao, Xiao, Xiang, Xiong, Kaizhi, Xu, Yifan, Yao, Shunyu, Yan, Binbin, Yan, Xiyu, Yang, Yong, Ye, Peihua, Yu, Chunxu, Yuan, Ying, Yuan, Zhe, Yun, Youhui, Zeng, Xinning, Zhang, Minzhen, Zhang, Peng, Zhang, Shibo, Zhang, Shu, Zhang, Tao, Zhang, Wei, Zhang, Yang, Zhang, Yingxin, Zhang, Yuanyuan, Zhao, Li, Zhou, Jifang, Zhou, Jiaxu, Zhou, Jiayi, Zhou, Ning, Zhou, Xiaopeng, Zhou, Yubo, and Zhou, Zhizhen
- Subjects
High Energy Physics - Experiment - Abstract
In this letter, we report the dark matter search results from the commissioning run and the first science run of the PandaX-4T experiment. A blind analysis is carried out on the entire data set. The data processing is improved compared to previous work, unifying the low-level signal reconstruction in a wide energy range up to 120 keV. With a total exposure of 1.54 tonne$\cdot$year, no significant excess of nuclear recoil events is found. The lowest 90% confidence level exclusion on the spin-independent cross section is $1.6 \times 10^{-47} \mathrm{cm}^2$ at a dark matter mass of 40 GeV$/c^2$. Our results represent the most stringent constraint for a dark matter mass above 100 GeV$/c^2$.
- Published
- 2024
34. Trainability maximization using estimation of distribution algorithms assisted by surrogate modelling for quantum architecture search
- Author
-
Soloviev, Vicente P., Dunjko, Vedran, Bielza, Concha, Larrañaga, Pedro, and Wang, Hao
- Subjects
Quantum Physics - Abstract
Quantum architecture search (QAS) involves optimizing both the quantum parametric circuit configuration but also its parameters for a variational quantum algorithm. Thus, the problem is known to be multi-level as the performance of a given architecture is unknown until its parameters are tuned using classical routines. Moreover, the task becomes even more complicated since well-known trainability issues, e.g., barren plateaus (BPs), can occur. In this paper, we aim to achieve two improvements in QAS: (1) to reduce the number of measurements by an online surrogate model of the evaluation process that aggressively discards architectures of poor performance; (2) to avoid training the circuits when BPs are present. To detect the presence of the BPs, we employed a recently developed metric, information content, which only requires measuring the energy values of a small set of parameters to estimate the magnitude of cost function's gradient. The main idea of this proposal is to leverage a recently developed metric which can be used to detect the onset of vanishing gradients to ensure the overall search avoids such unfavorable regions. We experimentally validate our proposal for the variational quantum eigensolver and showcase that our algorithm is able to find solutions that have been previously proposed in the literature for the Hamiltonians; but also to outperform the state of the art when initializing the method from the set of architectures proposed in the literature. The results suggest that the proposed methodology could be used in environments where it is desired to improve the trainability of known architectures while maintaining good performance.
- Published
- 2024
35. RRAM-Based Bio-Inspired Circuits for Mobile Epileptic Correlation Extraction and Seizure Prediction
- Author
-
Wang, Hao, Zhang, Lingfeng, Xiao, Erjia, Wang, Xin, Wang, Zhongrui, and Xu, Renjing
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Computer Science - Hardware Architecture - Abstract
Non-invasive mobile electroencephalography (EEG) acquisition systems have been utilized for long-term monitoring of seizures, yet they suffer from limited battery life. Resistive random access memory (RRAM) is widely used in computing-in-memory(CIM) systems, which offers an ideal platform for reducing the computational energy consumption of seizure prediction algorithms, potentially solving the endurance issues of mobile EEG systems. To address this challenge, inspired by neuronal mechanisms, we propose a RRAM-based bio-inspired circuit system for correlation feature extraction and seizure prediction. This system achieves a high average sensitivity of 91.2% and a low false positive rate per hour (FPR/h) of 0.11 on the CHB-MIT seizure dataset. The chip under simulation demonstrates an area of approximately 0.83 mm2 and a latency of 62.2 {\mu}s. Power consumption is recorded at 24.4 mW during the feature extraction phase and 19.01 mW in the seizure prediction phase, with a cumulative energy consumption of 1.515 {\mu}J for a 3-second window data processing, predicting 29.2 minutes ahead. This method exhibits an 81.3% reduction in computational energy relative to the most efficient existing seizure prediction approaches, establishing a new benchmark for energy efficiency., Comment: 7 pages, 5 figures
- Published
- 2024
36. SciPostLayout: A Dataset for Layout Analysis and Layout Generation of Scientific Posters
- Author
-
Tanaka, Shohei, Wang, Hao, and Ushiku, Yoshitaka
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Scientific posters are used to present the contributions of scientific papers effectively in a graphical format. However, creating a well-designed poster that efficiently summarizes the core of a paper is both labor-intensive and time-consuming. A system that can automatically generate well-designed posters from scientific papers would reduce the workload of authors and help readers understand the outline of the paper visually. Despite the demand for poster generation systems, only a limited research has been conduced due to the lack of publicly available datasets. Thus, in this study, we built the SciPostLayout dataset, which consists of 7,855 scientific posters and manual layout annotations for layout analysis and generation. SciPostLayout also contains 100 scientific papers paired with the posters. All of the posters and papers in our dataset are under the CC-BY license and are publicly available. As benchmark tests for the collected dataset, we conducted experiments for layout analysis and generation utilizing existing computer vision models and found that both layout analysis and generation of posters using SciPostLayout are more challenging than with scientific papers. We also conducted experiments on generating layouts from scientific papers to demonstrate the potential of utilizing LLM as a scientific poster generation system. The dataset is publicly available at https://huggingface.co/datasets/omron-sinicx/scipostlayout_v2. The code is also publicly available at https://github.com/omron-sinicx/scipostlayout., Comment: Accepted by BMVC2024
- Published
- 2024
37. Rina: Enhancing Ring-AllReduce with In-network Aggregation in Distributed Model Training
- Author
-
Chen, Zixuan, Liu, Xuandong, Li, Minglin, Hu, Yinfan, Mei, Hao, Xing, Huifeng, Wang, Hao, Shi, Wanxin, Liu, Sen, and Xu, Yang
- Subjects
Computer Science - Networking and Internet Architecture ,Computer Science - Artificial Intelligence ,Computer Science - Distributed, Parallel, and Cluster Computing - Abstract
Parameter Server (PS) and Ring-AllReduce (RAR) are two widely utilized synchronization architectures in multi-worker Deep Learning (DL), also referred to as Distributed Deep Learning (DDL). However, PS encounters challenges with the ``incast'' issue, while RAR struggles with problems caused by the long dependency chain. The emerging In-network Aggregation (INA) has been proposed to integrate with PS to mitigate its incast issue. However, such PS-based INA has poor incremental deployment abilities as it requires replacing all the switches to show significant performance improvement, which is not cost-effective. In this study, we present the incorporation of INA capabilities into RAR, called RAR with In-Network Aggregation (Rina), to tackle both the problems above. Rina features its agent-worker mechanism. When an INA-capable ToR switch is deployed, all workers in this rack run as one abstracted worker with the help of the agent, resulting in both excellent incremental deployment capabilities and better throughput. We conducted extensive testbed and simulation evaluations to substantiate the throughput advantages of Rina over existing DDL training synchronization structures. Compared with the state-of-the-art PS-based INA methods ATP, Rina can achieve more than 50\% throughput with the same hardware cost., Comment: To appear in ICNP 2024. Preview version only
- Published
- 2024
38. Seamless Website Fingerprinting in Multiple Environments
- Author
-
Song, Chuxu, Fan, Zining, Wang, Hao, and Martin, Richard
- Subjects
Computer Science - Cryptography and Security - Abstract
Website fingerprinting (WF) attacks identify the websites visited over anonymized connections by analyzing patterns in network traffic flows, such as packet sizes, directions, or interval times using a machine learning classifier. Previous studies showed WF attacks achieve high classification accuracy. However, several issues call into question whether existing WF approaches are realizable in practice and thus motivate a re-exploration. Due to Tor's performance issues and resulting poor browsing experience, the vast majority of users opt for Virtual Private Networking (VPN) despite VPNs weaker privacy protections. Many other past assumptions are increasingly unrealistic as web technology advances. Our work addresses several key limitations of prior art. First, we introduce a new approach that classifies entire websites rather than individual web pages. Site-level classification uses traffic from all site components, including advertisements, multimedia, and single-page applications. Second, our Convolutional Neural Network (CNN) uses only the jitter and size of 500 contiguous packets from any point in a TCP stream, in contrast to prior work requiring heuristics to find page boundaries. Our seamless approach makes eavesdropper attack models realistic. Using traces from a controlled browser, we show our CNN matches observed traffic to a website with over 90% accuracy. We found the training traffic quality is critical as classification accuracy is significantly reduced when the training data lacks variability in network location, performance, and clients' computational capability. We enhanced the base CNN's efficacy using domain adaptation, allowing it to discount irrelevant features, such as network location. Lastly, we evaluate several defensive strategies against seamless WF attacks., Comment: 16 pages
- Published
- 2024
39. Reduced-Space Iteratively Reweighted Second-Order Methods for Nonconvex Sparse Regularization
- Author
-
Wang, Hao, Yang, Xiangyu, and Zhu, Yichen
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning ,90C26, 49M15, 90C53 - Abstract
This paper explores a specific type of nonconvex sparsity-promoting regularization problems, namely those involving $\ell_p$-norm regularization, in conjunction with a twice continuously differentiable loss function. We propose a novel second-order algorithm designed to effectively address this class of challenging nonconvex and nonsmooth problems, showcasing several innovative features: (i) The use of an alternating strategy to solve a reweighted $\ell_1$ regularized subproblem and the subspace approximate Newton step. (ii) The reweighted $\ell_1$ regularized subproblem relies on a convex approximation to the nonconvex regularization term, enabling a closed-form solution characterized by the soft-thresholding operator. This feature allows our method to be applied to various nonconvex regularization problems. (iii) Our algorithm ensures that the iterates maintain their sign values and that nonzero components are kept away from 0 for a sufficient number of iterations, eventually transitioning to a perturbed Newton method. (iv) We provide theoretical guarantees of global convergence, local superlinear convergence in the presence of the Kurdyka-\L ojasiewicz (KL) property, and local quadratic convergence when employing the exact Newton step in our algorithm. We also showcase the effectiveness of our approach through experiments on a diverse set of model prediction problems.
- Published
- 2024
40. Poisoning with A Pill: Circumventing Detection in Federated Learning
- Author
-
Guo, Hanxi, Wang, Hao, Song, Tao, Zheng, Tianhang, Hua, Yang, Guan, Haibing, and Zhang, Xiangyu
- Subjects
Computer Science - Machine Learning ,Computer Science - Cryptography and Security ,Computer Science - Distributed, Parallel, and Cluster Computing - Abstract
Without direct access to the client's data, federated learning (FL) is well-known for its unique strength in data privacy protection among existing distributed machine learning techniques. However, its distributive and iterative nature makes FL inherently vulnerable to various poisoning attacks. To counteract these threats, extensive defenses have been proposed to filter out malicious clients, using various detection metrics. Based on our analysis of existing attacks and defenses, we find that there is a lack of attention to model redundancy. In neural networks, various model parameters contribute differently to the model's performance. However, existing attacks in FL manipulate all the model update parameters with the same strategy, making them easily detectable by common defenses. Meanwhile, the defenses also tend to analyze the overall statistical features of the entire model updates, leaving room for sophisticated attacks. Based on these observations, this paper proposes a generic and attack-agnostic augmentation approach designed to enhance the effectiveness and stealthiness of existing FL poisoning attacks against detection in FL, pointing out the inherent flaws of existing defenses and exposing the necessity of fine-grained FL security. Specifically, we employ a three-stage methodology that strategically constructs, generates, and injects poison (generated by existing attacks) into a pill (a tiny subnet with a novel structure) during the FL training, named as pill construction, pill poisoning, and pill injection accordingly. Extensive experimental results show that FL poisoning attacks enhanced by our method can bypass all the popular defenses, and can gain an up to 7x error rate increase, as well as on average a more than 2x error rate increase on both IID and non-IID data, in both cross-silo and cross-device FL systems.
- Published
- 2024
41. Theoretical Study on the Structural and Thermodynamic Properties of U-He compounds under High Pressure
- Author
-
Cao, Ye, Song, Hongxing, Yan, Xiaozhen, Wang, Hao, Wang, Yufeng, Wu, Fengchao, Zhang, Leilei, Wu, Qiang, and Geng, Hua Y.
- Subjects
Condensed Matter - Materials Science ,Physics - Applied Physics ,Physics - Computational Physics - Abstract
Uranium is considered as a very important nuclear energy material because of the huge amount of energy released. As the main products of spontaneous decay of uranium, helium is difficult to react with uranium for its chemical inertness. Therefore, bubbles will be formed inside uranium, which could greatly reduce the performance of uranium or cause the safety problems. Additionally, nuclear materials are usually operated in an environment of high-temperature and high-pressure, so it is necessary to figure out the exact state of helium inside uranium at extreme conditions. Here, we explored the structural stability of U-He system under high-pressure and high-temperature by using density functional theory calculations. Two metastable phases are found between 50 and 400 GPa: U4He with space group Fmmm and U6He with space group P-1. Both are metallic and adopt layered structures. Electron localization function calculation combined with charge density difference analysis indicate that there are covalent bonds between U and U atoms in both Fmmm-U4He and P-1-U6He. Compared with the elastic modulus of ${\alpha}$-U, the addition of helium has certain influence on the mechanical properties of uranium. Besides, first-principles molecular dynamics simulations were carried out to study the dynamical behavior of Fmmm-U4He and P-1-U6He at high-temperature. It is found that Fmmm-U4He and P-1-U6He undergo one-dimensional superionic phase transitions at 150 GPa. Our study revealed exotic structure of U-He compounds beyond the form of bubble under high-pressure and high-temperature, that might be relevant to the performance and safety issue of nuclear materials at extreme conditions., Comment: 8 pages, 4 figures, with Supplementary Information
- Published
- 2024
- Full Text
- View/download PDF
42. First-principles study of structural and electronic properties of multiferroic oxide Mn3TeO6 under high pressure
- Author
-
Pan, Xiao-Long, Wang, Hao, Liu, Lei, Chen, Xiang-Rong, and Geng, Hua Y.
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Other Condensed Matter ,Physics - Applied Physics ,Physics - Computational Physics - Abstract
Mn3TeO6 (MTO) has been experimentally found to adopt a P21/n structure under high pressure, which exhibits a significantly smaller band gap compared to the atmospheric R-3 phase. In this study, we systematically investigate the magnetism, structural phase transition and electronic properties of MTO under high pressure through first-principles calculations. Both R-3 and P21/n phases of MTO are antiferromagnetic at zero temperature. The R-3 phase transforms to the P21/n phase at 7.58 GPa, accompanied by a considerable volume collapse of about 6.47%. Employing the accurate method that combines DFT+U and G0W0, the calculated band gap of R-3 phase at zero pressure is very close to the experimental values, while that of the P21/n phase is significantly overestimated. The main reason for this difference is that the experimental study incorrectly used the Kubelka-Munk plot for the indirect band gap to obtain the band gap of the P21/n phase instead of the Kubelka-Munk plot for the direct band gap. Furthermore, our study reveals that the transition from the R-3 phase to the P21/n phase is accompanied by a slight reduction in the band gap., Comment: 17 pages, 11 figures
- Published
- 2024
- Full Text
- View/download PDF
43. Overview of AI-Debater 2023: The Challenges of Argument Generation Tasks
- Author
-
Lin, Jiayu, Chen, Guanrong, Jin, Bojun, Li, Chenyang, Jia, Shutong, Lin, Wancong, Sun, Yang, He, Yuhang, Yang, Caihua, Bao, Jianzhu, Wu, Jipeng, Su, Wen, Chen, Jinglu, Li, Xinyi, Chen, Tianyu, Han, Mingjie, Du, Shuaiwen, Wang, Zijian, Li, Jiyin, Suo, Fuzhong, Wang, Hao, Lin, Nuanchen, Huang, Xuanjing, Jiang, Changjian, Xu, RuiFeng, Zhang, Long, Cao, Jiuxin, Jin, Ting, and Wei, Zhongyu
- Subjects
Computer Science - Computation and Language - Abstract
In this paper we present the results of the AI-Debater 2023 Challenge held by the Chinese Conference on Affect Computing (CCAC 2023), and introduce the related datasets. We organize two tracks to handle the argumentative generation tasks in different scenarios, namely, Counter-Argument Generation (Track 1) and Claim-based Argument Generation (Track 2). Each track is equipped with its distinct dataset and baseline model respectively. In total, 32 competing teams register for the challenge, from which we received 11 successful submissions. In this paper, we will present the results of the challenge and a summary of the systems, highlighting commonalities and innovations among participating systems. Datasets and baseline models of the AI-Debater 2023 Challenge have been already released and can be accessed through the official website of the challenge.
- Published
- 2024
44. RBAD: A Dataset and Benchmark for Retinal Vessels Branching Angle Detection
- Author
-
Wang, Hao, Zhu, Wenhui, Qin, Jiayou, Li, Xin, Dumitrascu, Oana, Chen, Xiwen, Qiu, Peijie, and Razi, Abolfazl
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Electrical Engineering and Systems Science - Image and Video Processing - Abstract
Detecting retinal image analysis, particularly the geometrical features of branching points, plays an essential role in diagnosing eye diseases. However, existing methods used for this purpose often are coarse-level and lack fine-grained analysis for efficient annotation. To mitigate these issues, this paper proposes a novel method for detecting retinal branching angles using a self-configured image processing technique. Additionally, we offer an open-source annotation tool and a benchmark dataset comprising 40 images annotated with retinal branching angles. Our methodology for retinal branching angle detection and calculation is detailed, followed by a benchmark analysis comparing our method with previous approaches. The results indicate that our method is robust under various conditions with high accuracy and efficiency, which offers a valuable instrument for ophthalmic research and clinical applications.
- Published
- 2024
45. IPA-NeRF: Illusory Poisoning Attack Against Neural Radiance Fields
- Author
-
Jiang, Wenxiang, Zhang, Hanwei, Zhao, Shuo, Guo, Zhongwen, and Wang, Hao
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Cryptography and Security - Abstract
Neural Radiance Field (NeRF) represents a significant advancement in computer vision, offering implicit neural network-based scene representation and novel view synthesis capabilities. Its applications span diverse fields including robotics, urban mapping, autonomous navigation, virtual reality/augmented reality, etc., some of which are considered high-risk AI applications. However, despite its widespread adoption, the robustness and security of NeRF remain largely unexplored. In this study, we contribute to this area by introducing the Illusory Poisoning Attack against Neural Radiance Fields (IPA-NeRF). This attack involves embedding a hidden backdoor view into NeRF, allowing it to produce predetermined outputs, i.e. illusory, when presented with the specified backdoor view while maintaining normal performance with standard inputs. Our attack is specifically designed to deceive users or downstream models at a particular position while ensuring that any abnormalities in NeRF remain undetectable from other viewpoints. Experimental results demonstrate the effectiveness of our Illusory Poisoning Attack, successfully presenting the desired illusory on the specified viewpoint without impacting other views. Notably, we achieve this attack by introducing small perturbations solely to the training set. The code can be found at https://github.com/jiang-wenxiang/IPA-NeRF.
- Published
- 2024
46. Impact of evolving dark energy on the search for primordial gravitational waves
- Author
-
Wang, Hao, Ye, Gen, and Piao, Yun-Song
- Subjects
Astrophysics - Cosmology and Nongalactic Astrophysics ,General Relativity and Quantum Cosmology ,High Energy Physics - Theory - Abstract
Recent data seem to suggest a preference for the evolving dark energy (DE). However, if the case is actually so, and not caused by unknown systematics in data, it might impact our understanding about our Universe in an anomalous way due to the shifts of some primary parameters. As an example, we present the search for the primordial gravitational waves, based on the evolving DE. The joint analysis of recent BICEP/Keck cosmic microwave background (CMB) B-mode polarization data with Planck18 CMB, DESI baryon acoustic oscillations and PantheonPlus data shows that the bestfit tensor-to-scalar ratio is $r_{0.05}\sim 0.01$, and the lower bound of $r_{0.05}$ is $\sim 2\sigma$ non-zero., Comment: 14 pages, 4 figures
- Published
- 2024
47. First Indication of Solar $^8$B Neutrino Flux through Coherent Elastic Neutrino-Nucleus Scattering in PandaX-4T
- Author
-
PandaX Collaboration, Bo, Zihao, Chen, Wei, Chen, Xun, Chen, Yunhua, Cheng, Zhaokan, Cui, Xiangyi, Fan, Yingjie, Fang, Deqing, Gao, Zhixing, Geng, Lisheng, Giboni, Karl, Guo, Xunan, Guo, Xuyuan, Guo, Zichao, Han, Chencheng, Han, Ke, He, Changda, He, Jinrong, Huang, Di, Huang, Houqi, Huang, Junting, Hou, Ruquan, Hou, Yu, Ji, Xiangdong, Ji, Xiangpan, Ju, Yonglin, Li, Chenxiang, Li, Jiafu, Li, Mingchuan, Li, Shuaijie, Li, Tao, Li, Zhiyuan, Lin, Qing, Liu, Jianglai, Lu, Congcong, Lu, Xiaoying, Luo, Lingyin, Luo, Yunyang, Ma, Wenbo, Ma, Yugang, Mao, Yajun, Meng, Yue, Ning, Xuyang, Pang, Binyu, Qi, Ningchun, Qian, Zhicheng, Ren, Xiangxiang, Shan, Dong, Shang, Xiaofeng, Shao, Xiyuan, Shen, Guofang, Shen, Manbin, Sun, Wenliang, Tao, Yi, Wang, Anqing, Wang, Guanbo, Wang, Hao, Wang, Jiamin, Wang, Lei, Wang, Meng, Wang, Qiuhong, Wang, Shaobo, Wang, Siguang, Wang, Wei, Wang, Xiuli, Wang, Xu, Wang, Zhou, Wei, Yuehuan, Wu, Weihao, Wu, Yuan, Xiao, Mengjiao, Xiao, Xiang, Xiong, Kaizhi, Xu, Yifan, Yao, Shunyu, Yan, Binbin, Yan, Xiyu, Yang, Yong, Ye, Peihua, Yu, Chunxu, Yuan, Ying, Yuan, Zhe, Yun, Youhui, Zeng, Xinning, Zhang, Minzhen, Zhang, Peng, Zhang, Shibo, Zhang, Shu, Zhang, Tao, Zhang, Wei, Zhang, Yang, Zhang, Yingxin, Zhang, Yuanyuan, Zhao, Li, Zhou, Jifang, Zhou, Jiaxu, Zhou, Jiayi, Zhou, Ning, Zhou, Xiaopeng, Zhou, Yubo, and Zhou, Zhizhen
- Subjects
High Energy Physics - Experiment ,Astrophysics - Solar and Stellar Astrophysics ,Nuclear Experiment - Abstract
The PandaX-4T liquid xenon detector at the China Jinping Underground Laboratory is used to measure the solar $^8$B neutrino flux by detecting neutrinos through coherent scattering with xenon nuclei. Data samples requiring the coincidence of scintillation and ionization signals (paired), as well as unpaired ionization-only signals (US2), are selected with energy threshold of approximately 1.1 keV (0.33 keV) nuclear recoil energy. Combining the commissioning run and the first science run of PandaX-4T, a total exposure of 1.20 and 1.04 tonne$\cdot$year are collected for the paired and US2, respectively. After unblinding, 3 and 332 events are observed with an expectation of 2.8$\pm$0.5 and 251$\pm$32 background events, for the paired and US2 data, respectively. A combined analysis yields a best-fit $^8$B neutrino signal of 3.5 (75) events from the paired (US2) data sample, with $\sim$37\% uncertainty, and the background-only hypothesis is disfavored at 2.64$\sigma$ significance. This gives a solar $^8$B neutrino flux of ($8.4\pm3.1$)$\times$10$^6$ cm$^{-2}$s$^{-1}$, consistent with the standard solar model prediction. It is also the first indication of solar $^8$B neutrino ``fog'' in a dark matter direct detection experiment., Comment: Accepted by Physical Review Letters
- Published
- 2024
48. Learning Unlabeled Clients Divergence via Anchor Model Aggregation for Federated Semi-supervised Learning
- Author
-
Elbatel, Marawan, Wang, Hualiang, Chen, Jixiang, Wang, Hao, and Li, Xiaomeng
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Federated semi-supervised learning (FedSemi) refers to scenarios where there may be clients with fully labeled data, clients with partially labeled, and even fully unlabeled clients while preserving data privacy. However, challenges arise from client drift due to undefined heterogeneous class distributions and erroneous pseudo-labels. Existing FedSemi methods typically fail to aggregate models from unlabeled clients due to their inherent unreliability, thus overlooking unique information from their heterogeneous data distribution, leading to sub-optimal results. In this paper, we enable unlabeled client aggregation through SemiAnAgg, a novel Semi-supervised Anchor-Based federated Aggregation. SemiAnAgg learns unlabeled client contributions via an anchor model, effectively harnessing their informative value. Our key idea is that by feeding local client data to the same global model and the same consistently initialized anchor model (i.e., random model), we can measure the importance of each unlabeled client accordingly. Extensive experiments demonstrate that SemiAnAgg achieves new state-of-the-art results on four widely used FedSemi benchmarks, leading to substantial performance improvements: a 9% increase in accuracy on CIFAR-100 and a 7.6% improvement in recall on the medical dataset ISIC-18, compared with prior state-of-the-art. Code is available at: https://github.com/xmed-lab/SemiAnAgg.
- Published
- 2024
49. Parallel Ising Annealer via Gradient-based Hamiltonian Monte Carlo
- Author
-
Wang, Hao, Liu, Zixuan, Xie, Zhixin, Li, Langyu, Miao, Zibo, Cui, Wei, and Pan, Yu
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies ,Mathematics - Combinatorics - Abstract
Ising annealer is a promising quantum-inspired computing architecture for combinatorial optimization problems. In this paper, we introduce an Ising annealer based on the Hamiltonian Monte Carlo, which updates the variables of all dimensions in parallel. The main innovation is the fusion of an approximate gradient-based approach into the Ising annealer which introduces significant acceleration and allows a portable and scalable implementation on the commercial FPGA. Comprehensive simulation and hardware experiments show that the proposed Ising annealer has promising performance and scalability on all types of benchmark problems when compared to other Ising annealers including the state-of-the-art hardware. In particular, we have built a prototype annealer which solves Ising problems of both integer and fraction coefficients with up to 200 spins on a single low-cost FPGA board, whose performance is demonstrated to be better than the state-of-the-art quantum hardware D-Wave 2000Q and similar to the expensive coherent Ising machine. The sub-linear scalability of the annealer signifies its potential in solving challenging combinatorial optimization problems and evaluating the advantage of quantum hardware.
- Published
- 2024
50. Stochastic generalized Kolmogorov systems with small diffusion: II. Explicit approximations for periodic solutions in distribution
- Author
-
Zhou, Baoquan, Wang, Hao, Wang, Tianxu, and Jiang, Daqing
- Subjects
Mathematics - Dynamical Systems ,37H05, 37H30, 45M15, 60H10 - Abstract
This paper is Part II of a two-part series on coexistence states study in stochastic generalized Kolmogorov systems under small diffusion. Part I provided a complete characterization for approximating invariant probability measures and density functions, while here, we focus on explicit approximations for periodic solutions in distribution. Two easily implementable methods are introduced: periodic normal approximation (PNOA) and periodic log-normal approximation (PLNA). These methods offer unified algorithms to calculate the mean and covariance matrix, and verify positive definiteness, without additional constraints like non-degenerate diffusion. Furthermore, we explore essential properties of the covariance matrix, particularly its connection under periodic and non-periodic drift coefficients. Our new approximation methods significantly relax the minimal criteria for positive definiteness of the solution of the discrete-type Lyapunov equation. Some numerical experiments are provided to support our theoretical results., Comment: 39 pages, 5 figures
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.