Search arXiv⌕ Search

arXiv subjects

Xiaoyang Wang

Publications and source records attributed to Xiaoyang Wang.

At least 145 records · Page 8Linked to original sources

Invariant Aggregator for Defending against Federated Backdoor Attacks

Federated learning enables training high-utility models across several clients without directly sharing their private data. As a downside, the federated setting makes the model vulnerable to various adversarial attacks in the presence of malicious clients. Despite the theoretical and empirical success in defending against attacks that aim to degrade models' utility, defense against backdoor attacks that increase model accuracy on backdoor samples exclusively without hurting the utility on other samples remains challenging. To this end, we first analyze the failure modes of existing defenses over a flat loss landscape, which is common for well-designed neural networks such as Resnet (He et al., 2015) but is often overlooked by previous works. Then, we propose an invariant aggregator that redirects the aggregated update to invariant directions that are generally useful via selectively masking out the update elements that favor few and possibly malicious clients. Theoretical results suggest that our approach provably mitigates backdoor attacks and remains effective over flat loss landscapes. Empirical results on three datasets with different modalities and varying numbers of clients further demonstrate that our approach mitigates a broad class of backdoor attacks with a negligible cost on the model utility.

cs.LG↗

Can Large Language Models do Analytical Reasoning?

This paper explores the cutting-edge Large Language Model with analytical reasoning on sports. Our analytical reasoning embodies the tasks of letting large language models count how many points each team scores in a quarter in the NBA and NFL games. Our major discoveries are in two folds. Firstly, we find among all the models we employed, GPT-4 stands out in effectiveness, followed by Claude-2.1, with GPT-3.5, Gemini-Pro, and Llama-2-70b lagging behind. Specifically, we compare three different prompting techniques and a divide-and-conquer approach, we find that the latter was the most effective. Our divide-and-conquer approach breaks down play-by-play data into smaller, more manageable segments, solves each piece individually, and then aggregates them together. Besides the divide-and-conquer approach, we also explore the Chain of Thought (CoT) strategy, which markedly improves outcomes for certain models, notably GPT-4 and Claude-2.1, with their accuracy rates increasing significantly. However, the CoT strategy has negligible or even detrimental effects on the performance of other models like GPT-3.5 and Gemini-Pro. Secondly, to our surprise, we observe that most models, including GPT-4, struggle to accurately count the total scores for NBA quarters despite showing strong performance in counting NFL quarter scores. This leads us to further investigate the factors that impact the complexity of analytical reasoning tasks with extensive experiments, through which we conclude that task complexity depends on the length of context, the information density, and the presence of related information. Our research provides valuable insights into the complexity of analytical reasoning tasks and potential directions for developing future large language models.

cs.CL↗

Enhancing Graph Topology and Clustering Quality: A Modularity-Guided Approach

Current modularity-based community detection algorithms attempt to find cluster memberships that maximize modularity within a fixed graph topology. Diverging from this conventional approach, our work introduces a novel strategy that employs modularity to guide the enhancement of both graph topology and clustering quality through a maximization process. Specifically, we present a modularity-guided approach for learning sparse graphs with high modularity by iteratively pruning edges between distant clusters, informed by algorithmically generated clustering results. To validate the theoretical underpinnings of modularity, we designed experiments that establish a quantitative relationship between modularity and clustering quality. Extensive experiments conducted on various real-world datasets demonstrate that our method significantly outperforms state-of-the-art graph construction methods in terms of clustering accuracy. Moreover, when compared to these leading methods, our approach achieves up to a hundredfold increase in graph construction efficiency on large-scale datasets, illustrating its potential for broad application in complex network analysis.

physics.data-an↗

SPECTRUM: Speaker-Enhanced Pre-Training for Long Dialogue Summarization

Multi-turn dialogues are characterized by their extended length and the presence of turn-taking conversations. Traditional language models often overlook the distinct features of these dialogues by treating them as regular text. In this paper, we propose a speaker-enhanced pre-training method for long dialogue summarization, which leverages the inherent structure of multiple-turn dialogues. To support our study, we curate a diverse dataset that includes transcripts from real-world scenarios, movie or TV show transcripts, and dialogues generated by a Large Language Model. We then perform a pre-training, which encompasses the detection of speaker changes, and masked utterance generation. Experimental results of fine-tuned models demonstrate that our model achieves state-of-the-art performance on downstream benchmarks with long context, surpassing baseline models and highlighting the effectiveness of our approach. Our findings highlight the importance of curating pre-training datasets that exhibit diversity and variations in length distribution to ensure effective alignment with downstream datasets.

cs.CL↗

FedCore: Straggler-Free Federated Learning with Distributed Coresets

Federated learning (FL) is a machine learning paradigm that allows multiple clients to collaboratively train a shared model while keeping their data on-premise. However, the straggler issue, due to slow clients, often hinders the efficiency and scalability of FL. This paper presents FedCore, an algorithm that innovatively tackles the straggler problem via the decentralized selection of coresets, representative subsets of a dataset. Contrary to existing centralized coreset methods, FedCore creates coresets directly on each client in a distributed manner, ensuring privacy preservation in FL. FedCore translates the coreset optimization problem into a more tractable k-medoids clustering problem and operates distributedly on each client. Theoretical analysis confirms FedCore's convergence, and practical evaluations demonstrate an 8x reduction in FL training time, without compromising model accuracy. Our extensive evaluations also show that FedCore generalizes well to existing FL frameworks.

cs.DC↗

SFC: Shared Feature Calibration in Weakly Supervised Semantic Segmentation

Image-level weakly supervised semantic segmentation has received increasing attention due to its low annotation cost. Existing methods mainly rely on Class Activation Mapping (CAM) to obtain pseudo-labels for training semantic segmentation models. In this work, we are the first to demonstrate that long-tailed distribution in training data can cause the CAM calculated through classifier weights over-activated for head classes and under-activated for tail classes due to the shared features among head- and tail- classes. This degrades pseudo-label quality and further influences final semantic segmentation performance. To address this issue, we propose a Shared Feature Calibration (SFC) method for CAM generation. Specifically, we leverage the class prototypes that carry positive shared features and propose a Multi-Scaled Distribution-Weighted (MSDW) consistency loss for narrowing the gap between the CAMs generated through classifier weights and class prototypes during training. The MSDW loss counterbalances over-activation and under-activation by calibrating the shared features in head-/tail-class classifier weights. Experimental results show that our SFC significantly improves CAM boundaries and achieves new state-of-the-art performances. The project is available at https://github.com/Barrett-python/SFC.

cs.CV↗

InFoBench: Evaluating Instruction Following Ability in Large Language Models

This paper introduces the Decomposed Requirements Following Ratio (DRFR), a new metric for evaluating Large Language Models' (LLMs) ability to follow instructions. Addressing a gap in current methodologies, DRFR breaks down complex instructions into simpler criteria, facilitating a detailed analysis of LLMs' compliance with various aspects of tasks. Alongside this metric, we present InFoBench, a benchmark comprising 500 diverse instructions and 2,250 decomposed questions across multiple constraint categories. Our experiments compare DRFR with traditional scoring methods and explore annotation sources, including human experts, crowd-sourced workers, and GPT-4. The findings demonstrate DRFR's higher reliability and the effectiveness of using GPT-4 as a cost-efficient annotator. The evaluation of several advanced LLMs using this framework reveals their strengths and areas needing improvement, particularly in complex instruction-following. This study contributes a novel metric and benchmark, offering insights for future LLM development and evaluation.

cs.CL↗

Zebra: Extending Context Window with Layerwise Grouped Local-Global Attention

This paper introduces a novel approach to enhance the capabilities of Large Language Models (LLMs) in processing and understanding extensive text sequences, a critical aspect in applications requiring deep comprehension and synthesis of large volumes of information. Recognizing the inherent challenges in extending the context window for LLMs, primarily built on Transformer architecture, we propose a new model architecture, referred to as Zebra. This architecture efficiently manages the quadratic time and memory complexity issues associated with full attention in the Transformer by employing grouped local-global attention layers. Our model, akin to a zebra's alternating stripes, balances local and global attention layers, significantly reducing computational requirements and memory consumption. Comprehensive experiments, including pretraining from scratch, continuation of long context adaptation training, and long instruction tuning, are conducted to evaluate the Zebra's performance. The results show that Zebra achieves comparable or superior performance on both short and long sequence benchmarks, while also enhancing training and inference efficiency.

cs.CL↗

DecipherPref: Analyzing Influential Factors in Human Preference Judgments via GPT-4

Human preference judgments are pivotal in guiding large language models (LLMs) to produce outputs that align with human values. Human evaluations are also used in summarization tasks to compare outputs from various systems, complementing existing automatic metrics. Despite their significance, however, there has been limited research probing these pairwise or $k$-wise comparisons. The collective impact and relative importance of factors such as output length, informativeness, fluency, and factual consistency are still not well understood. It is also unclear if there are other hidden factors influencing human judgments. In this paper, we conduct an in-depth examination of a collection of pairwise human judgments released by OpenAI. Utilizing the Bradley-Terry-Luce (BTL) model, we reveal the inherent preferences embedded in these human judgments. We find that the most favored factors vary across tasks and genres, whereas the least favored factors tend to be consistent, e.g., outputs are too brief, contain excessive off-focus content or hallucinated facts. Our findings have implications on the construction of balanced datasets in human preference evaluations, which is a crucial step in shaping the behaviors of future LLMs.

cs.CL↗

Unsupervised Multi-document Summarization with Holistic Inference

Multi-document summarization aims to obtain core information from a collection of documents written on the same topic. This paper proposes a new holistic framework for unsupervised multi-document extractive summarization. Our method incorporates the holistic beam search inference method associated with the holistic measurements, named Subset Representative Index (SRI). SRI balances the importance and diversity of a subset of sentences from the source documents and can be calculated in unsupervised and adaptive manners. To demonstrate the effectiveness of our method, we conduct extensive experiments on both small and large-scale multi-document summarization datasets under both unsupervised and adaptive settings. The proposed method outperforms strong baselines by a significant margin, as indicated by the resulting ROUGE scores and diversity measures. Our findings also suggest that diversity is essential for improving multi-document summary performance.

cs.CL↗

Critical behavior of Ising model by preparing thermal state on quantum computer

We simulate the critical behavior of the Ising model utilizing a thermal state prepared using quantum computing techniques. The preparation of the thermal state is based on the variational quantum imaginary time evolution (QITE) algorithm. The initial state of QITE is prepared as a classical product state, and we propose a systematic method to design the variational ansatz for QITE. We calculate the specific heat and susceptibility of the long-range interacting Ising model and observe indications of the Ising criticality on a small lattice size. We find the results derived by the quantum algorithm are well consistent with the ones from exact diagonalization, both in the neighbourhood of the critical temperature and the low-temperature region.

quant-ph↗

Symmetry enhanced variational quantum imaginary time evolution

The variational quantum imaginary time evolution (VarQITE) algorithm is a near-term method to prepare the ground state and Gibbs state of Hamiltonians. Finding an appropriate parameterization of the quantum circuit is crucial to the success of VarQITE. This work provides guidance for constructing parameterized quantum circuits according to the locality and symmetries of the Hamiltonian. Our approach can be used to implement the unitary and anti-unitary symmetries of a quantum system, which significantly reduces the depth and degree of freedom of the parameterized quantum circuits. To benchmark the proposed parameterized quantum circuits, we carry out VarQITE experiments on statistical models. Numerical results confirm that the symmetry-enhanced circuits outperform the frequently-used parametrized circuits in the literature.

quant-ph↗

Simulating the Spread of Infection in Networks with Quantum Computers

We propose to use quantum computers to simulate infection spreading in networks. We first show the analogy between the infection distribution and spin-lattice configurations with Ising-type interactions. Then, since the spreading process can be modeled as a classical Markovian process, we show that the spreading process can be simulated using the evolution of a quantum thermal dynamic model with a parameterized Hamiltonian. In particular, we analytically and numerically analyze the evolution behavior of the Hamiltonian, and prove that the evolution simulates a classical Markovian process, which describes the well-known epidemiological stochastic susceptible and infectious (SI) model. A practical method to determine the parameters of the thermal dynamic Hamiltonian from epidemiological inputs is exhibited. As an example, we simulate the infection spreading process of the SARS-Cov-2 variant Omicron in a small-world network.

quant-ph↗

Pretrained Language Model based Web Search Ranking: From Relevance to Satisfaction

Search engine plays a crucial role in satisfying users' diverse information needs. Recently, Pretrained Language Models (PLMs) based text ranking models have achieved huge success in web search. However, many state-of-the-art text ranking approaches only focus on core relevance while ignoring other dimensions that contribute to user satisfaction, e.g., document quality, recency, authority, etc. In this work, we focus on ranking user satisfaction rather than relevance in web search, and propose a PLM-based framework, namely SAT-Ranker, which comprehensively models different dimensions of user satisfaction in a unified manner. In particular, we leverage the capacities of PLMs on both textual and numerical inputs, and apply a multi-field input that modularizes each dimension of user satisfaction as an input field. Overall, SAT-Ranker is an effective, extensible, and data-centric framework that has huge potential for industrial applications. On rigorous offline and online experiments, SAT-Ranker obtains remarkable gains on various evaluation sets targeting different dimensions of user satisfaction. It is now fully deployed online to improve the usability of our search engine.

cs.IR↗

OASum: Large-Scale Open Domain Aspect-based Summarization

Aspect or query-based summarization has recently caught more attention, as it can generate differentiated summaries based on users' interests. However, the current dataset for aspect or query-based summarization either focuses on specific domains, contains relatively small-scale instances, or includes only a few aspect types. Such limitations hinder further explorations in this direction. In this work, we take advantage of crowd-sourcing knowledge on Wikipedia.org and automatically create a high-quality, large-scale open-domain aspect-based summarization dataset named OASum, which contains more than 3.7 million instances with around 1 million different aspects on 2 million Wikipedia pages. We provide benchmark results on OASum and demonstrate its ability for diverse aspect-based summarization generation. To overcome the data scarcity problem on specific domains, we also perform zero-shot, few-shot, and fine-tuning on seven downstream datasets. Specifically, zero/few-shot and fine-tuning results show that the model pre-trained on our corpus demonstrates a strong aspect or query-focused generation ability compared with the backbone model. Our dataset and pre-trained checkpoints are publicly available.

cs.CL↗

Streamlining Multimodal Data Fusion in Wireless Communication and Sensor Networks

This paper presents a novel approach for multimodal data fusion based on the Vector-Quantized Variational Autoencoder (VQVAE) architecture. The proposed method is simple yet effective in achieving excellent reconstruction performance on paired MNIST-SVHN data and WiFi spectrogram data. Additionally, the multimodal VQVAE model is extended to the 5G communication scenario, where an end-to-end Channel State Information (CSI) feedback system is implemented to compress data transmitted between the base-station (eNodeB) and User Equipment (UE), without significant loss of performance. The proposed model learns a discriminative compressed feature space for various types of input data (CSI, spectrograms, natural images, etc), making it a suitable solution for applications with limited computational resources.

cs.LG↗

Data-Driven Prediction of Complex Crystal Structures of Dense Lithium

Lithium (Li) is a prototypical simple metal at ambient conditions, but exhibits remarkable changes in structural and electronic properties under compression. There has been intense debate about the structure of dense Li, and recent experiments offered fresh evidence for new yet undetermined crystalline phases near the enigmatic melting minimum region in the pressure-temperature phase diagram of Li. Here, we report on an extensive exploration of the energy landscape of Li using an advanced crystal structure search method combined with a machine learning approach, which greatly expands the scale of structure search, leading to the prediction of four complex Li crystal phases containing up to 192 atoms in the unit cell that are energetically competitive with known Li structures. These findings provide a viable solution to the newly observed yet unidentified crystalline phases of Li, and showcase the predictive power of the global structure search method for discovering complex crystal structures in conjunction with accurate machine-learning potentials.

cond-mat.mtrl-sci↗

Nodal s$_\pm$ Pairing Symmetry in an Iron-Based Superconductor with only Hole Pockets

The origin of the high temperature superconductivity in the iron-based superconductors remains elusive after being extensively studied for more than a decade. Determination of the pairing symmetry is essential in understanding the superconductivity mechanism. In the iron-based superconductors that have hole pockets around the Brillouin zone center and electron pockets around the zone corners, the pairing symmetry is generally considered to be s$_\pm$, endowing a sign change in the superconducting gap between the hole and electron pockets. For the iron-based superconductors with only hole pockets, however, a couple of pairing scenarios have been proposed but the exact symmetry is still highly controversial. Here we report our determination of the pairing symmetry in KFe$_2$As$_2$ which is a prototypical iron-based superconductor with hole pockets both around the zone center and around the zone corners. By taking laser-based angle resolved photoemission measurements with super-high resolution and at ultra-low temperature, we have precisely determined the superconducting gap distribution and identified the locations of the gap nodes on all the Fermi surface around the zone center and the zone corners. The complete superconducting gap structure, in combination with the observation of the spin resonance in neutron scattering, provides strong evidence on the s$_\pm$ pairing symmetry in KFe$_2$As$_2$ with a gap sign reversal between the hole pockets around the zone center and the hole pockets around the zone corners. These results unify the pairing symmetry in the hole-doped iron-based superconductors and point to the spin fluctuation as the pairing glue in generating superconductivity.

cond-mat.supr-con↗