arXiv subjects

Tao Guo

Publications and source records attributed to Tao Guo.

At least 37 records · Page 2Linked to original sources

arXiv2025

$α$-leakage Interpretation of Rényi Capacity

For $\tilde{f}(t) = \exp(\frac{α-1}αt)$, this paper shows that the Sibson mutual information is an $α$-leakage averaged over the adversary's $\tilde{f}$-mean relative information gain (on the secret) at elementary event of channel output $Y$ as well as the joint occurrence of elementary channel input $X$ and output $Y$. This interpretation is used to derive a sufficient condition that achieves a $δ$-approximation of $ε$-upper bounded $α$-leakage. A $Y$-elementary $α$-leakage is proposed, extending the existing pointwise maximal leakage to the overall Rényi order range $α\in [0,\infty)$. Maximizing this $Y$-elementary leakage over all attributes $U$ of channel input $X$ gives the Rényi divergence. Further, the Rényi capacity is interpreted as the maximal $\tilde{f}$-mean information leakage over both the adversary's malicious inference decision and the channel input $X$ (represents the adversary's prior belief). This suggests an alternating max-max implementation of the existing generalized Blahut-Arimoto method.

cs.IT↗

arXiv2025

NS-Pep: De novo Peptide Design with Non-Standard Amino Acids

Peptide drugs incorporating non-standard amino acids (NSAAs) offer improved binding affinity and improved pharmacological properties. However, existing peptide design methods are limited to standard amino acids, leaving NSAA-aware design largely unexplored. We introduce NS-Pep, a unified framework for co-designing peptide sequences and structures with NSAAs. The main challenge is that NSAAs are extremely underrepresented-even the most frequent one, SEP, accounts for less than 0.4% of residues-resulting in a severe long-tailed distribution. To improve generalization to rare amino acids, we propose Residue Frequency-Guided Modification (RFGM), which mitigates over-penalization through frequency-aware logit calibration, supported by both theoretical and empirical analysis. Furthermore, we identify that insufficient side-chain modeling limits geometric representation of NSAAs. To address this, we introduce Progressive Side-chain Perception (PSP) for coarse-to-fine torsion and location prediction, and Interaction-Aware Weighting (IAW) to emphasize pocket-proximal residues. Moreover, NS-Pep generalizes naturally to the peptide folding task with NSAAs, addressing a major limitation of current tools. Experiments show that NS-Pep improves sequence recovery rate and binding affinity by 6.23% and 5.12%, respectively, and outperforms AlphaFold3 by 17.76% in peptide folding success rate.

q-bio.BM↗

arXiv2025

On the Evolution of Federated Post-Training Large Language Models: A Model Accessibility View

Federated Learning (FL) enables training models across decentralized data silos while preserving client data privacy. Recent research has explored efficient methods for post-training large language models (LLMs) within FL to address computational and communication challenges. While existing approaches often rely on access to LLMs' internal information, which is frequently restricted in real-world scenarios, an inference-only paradigm (black-box FedLLM) has emerged to address these limitations. This paper presents a comprehensive survey on federated tuning for LLMs. We propose a taxonomy categorizing existing studies along two axes: model access-based and parameter efficiency-based optimization. We classify FedLLM approaches into white-box, gray-box, and black-box techniques, highlighting representative methods within each category. We review emerging research treating LLMs as black-box inference APIs and discuss promising directions and open challenges for future research.

cs.LG↗

arXiv2025

MambaMorph: a Mamba-based Framework for Medical MR-CT Deformable Registration

Capturing voxel-wise spatial correspondence across distinct modalities is crucial for medical image analysis. However, current registration approaches are not practical enough in terms of registration accuracy and clinical applicability. In this paper, we introduce MambaMorph, a novel multi-modality deformable registration framework. Specifically, MambaMorph utilizes a Mamba-based registration module and a fine-grained, yet simple, feature extractor for efficient long-range correspondence modeling and high-dimensional feature learning, respectively. Additionally, we develop a well-annotated brain MR-CT registration dataset, SR-Reg, to address the scarcity of data in multi-modality registration. To validate MambaMorph's multi-modality registration capabilities, we conduct quantitative experiments on both our SR-Reg dataset and a public T1-T2 dataset. The experimental results on both datasets demonstrate that MambaMorph significantly outperforms the current state-of-the-art learning-based registration methods in terms of registration accuracy. Further study underscores the efficiency of the Mamba-based registration module and the lightweight feature extractor, which achieve notable registration quality while maintaining reasonable computational costs and speeds. We believe that MambaMorph holds significant potential for practical applications in medical image registration. The code for MambaMorph is available at: https://github.com/Guo-Stone/MambaMorph.

cs.CV↗

arXiv2025

Hydrogen-like structures in the strong interaction

Heavy flavor hadrons, especially doubly heavy baryons and doubly heavy tetraquarks, have always received extensive attention in theoretical and experimental research. Given the separation of quark masses $m_Q \gg m_q$ ($Q = c, b$ and $q = u, d, s$), this type of heavy flavor hadrons can be well regarded as hydrogen-like structures in the strong interaction. In the theoretical framework of Born-Oppenheimer approximation, we derive the Schr{ö}dinger equation for the motion of light quarks in the effective potential field of heavy quarks. Taking proper account of the color-spin hyperfine interaction, we carry out a systematic study on the mass spectra of $S$-wave doubly heavy baryons and doubly heavy tetraquarks. The model parameters required for the calculation are obtained by fitting conventional hadrons. The investigation on the doubly heavy baryon systems indicates the reliability of our theoretical approach. Our calculation results show that the experimentally discovered $T_{cc}^+$ is most likely a compact tetraquark $|(cc)_0^{6}(\bar{u}\bar{d})_1^{\bar{6}}\rangle$ state with quantum numbers $(I,J^P)=(0, 1^+)$. Forthermore, for different quantum number assignments, some stable tetraquark states are found and may be very narrow peaks. The predictions for other heavy flavor hadrons are expected to be confirmed in new theories and future experiments.

hep-ph↗

arXiv2025

Finite difference method for nonlinear damped viscoelastic Euler-Bernoulli beam model

We propose and analyze the numerical approximation for a viscoelastic Euler-Bernoulli beam model containing a nonlinear strong damping coefficient. The finite difference method is used for spatial discretization, while the backward Euler method and the averaged PI rule are applied for temporal discretization. The long-time stability and the finite-time error estimate of the numerical solutions are derived for both the semi-discrete-in-space scheme and the fully-discrete scheme. Furthermore, the Leray-Schauder theorem is used to derive the existence and uniqueness of the fully-discrete numerical solutions. Finally, the numerical results verify the theoretical analysis.

math.NA↗

arXiv2025

Compact difference method for Euler-Bernoulli beams and plates with nonlinear nonlocal strong damping

We investigate the numerical approximation to the Euler-Bernoulli (E-B) beams and plates with nonlinear nonlocal strong damping, which describes the damped mechanical behavior of beams and plates in real applications. We discretize the damping term by the composite Simpson's rule and the six-point Simpson's formula in the beam and plate problems, respectively, and then construct the fully discrete compact difference scheme for these problems. To account for the nonlinear-nonlocal term, we design several novel discrete norms to facilitate the error estimates of the damping term and the numerical scheme. The stability, convergence, and energy dissipation properties of the proposed scheme are proved, and numerical experiments are carried out to substantiate the theoretical findings.

math.NA↗

arXiv2025

Hidden heavy flavor tetraquarks in the Born-Oppenheimer approximation

The Born-Oppenheimer approximation is one of the very successful tools for solving the hydrogen atom problem. The experimental discovery of hidden heavy flavor tetraquarks, $Q\bar{Q}q \bar{q}$ ($Q=c,b$ and $q=u,d,s$), provides great possibilities for the hydrogen-bond-like structure of the Quantum Chromodynamics version. In this work, considering that the colors of $Q\bar{Q}$ and $q\bar{q}$ are both $8$, the tetraquark $Q\bar{Q}q \bar{q}$ system is formed by color coupling $8\otimes8 \rightarrow 1$. In order to study the mass splitting caused by the color-spin hyperfine interaction, the color-spin basis vectors of the $S$-wave tetraquark states are appropriately constructed. Then we use the Born-Oppenheimer approximation to calculate the mass spectra of the $S$-wave hidden heavy flavor tetraquark states. The results show that some of the hidden heavy flavor exotic hadrons discovered experimentally can be well explained as this type of hydrogen-bond-like tetraquark structure. In addition, some candidates for tetraquark bound states are predicted and may be compact tetraquark states.

hep-ph↗

arXiv2025

Computation of a Unified Graph-Based Rate Optimization Problem

We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and capacity-cost functions with side information. Compared with their classical counterparts, theoretical limits with side information are much more difficult to compute since their characterizations as optimization problems have larger and more complex feasible regions. Following the unified approach, we develop effective methods to resolve the difficulty. On the theoretical side, we derive graph characterizations for rate-distortion and capacity-cost functions with side information and simplify the characterizations in special cases by reducing the number of decision variables. On the computational side, we design an efficient alternating minimization algorithm for the graph-based problem, which deals with the inequality constraint by a flexible multiplier update strategy. Moreover, simplified graph characterizations are exploited and deflation techniques are introduced, so that the computing time is greatly reduced. Theoretical analysis shows that the algorithm converges to an optimal solution. By numerical experiments, the accuracy and efficiency of the algorithm are illustrated and its significant advantage over existing methods is demonstrated.

cs.IT↗

arXiv2025

Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal

Consider the communication-constrained problem of nonparametric function estimation, in which each distributed terminal holds multiple i.i.d. samples. Under certain regularity assumptions, we characterize the minimax optimal rates for all regimes, and identify phase transitions of the optimal rates as the samples per terminal vary from sparse to dense. This fully solves the problem left open by previous works, whose scopes are limited to regimes with either dense samples or a single sample per terminal. To achieve the optimal rates, we design a layered estimation protocol by exploiting protocols for the parametric density estimation problem. We show the optimality of the protocol using information-theoretic methods and strong data processing inequalities, and incorporating the classic balls and bins model. The optimal rates are immediate for various special cases such as density estimation, Gaussian, binary, Poisson and heteroskedastic regression models.

cs.LG↗

arXiv2024

A multiscale Abel kernel and application in viscoelastic problem

We consider the variable-exponent Abel kernel and demonstrate its multiscale nature in modeling crossover dynamics from the initial quasi-exponential behavior to long-term power-law behavior. Then we apply this to an integro-differential equation modeling, e.g. mechanical vibration of viscoelastic materials with changing material properties. We apply the Crank-Nicolson method and the linear interpolation quadrature to design a temporal second-order scheme, and develop a framework of exponentially weighted energy argument in error estimate to account for the non-positivity and non-monotonicity of the multiscale kernel. Numerical experiments are carried out to substantiate the theoretical findings and the crossover dynamics of the model.

math.NA↗

arXiv2024

Adaptive Refinement Protocols for Distributed Distribution Estimation under $\ell^p$-Losses

Consider the communication-constrained estimation of discrete distributions under $\ell^p$ losses, where each distributed terminal holds multiple independent samples and uses limited number of bits to describe the samples. We obtain the minimax optimal rates of the problem in most parameter regimes. An elbow effect of the optimal rates at $p=2$ is clearly identified. To show the optimal rates, we first design estimation protocols to achieve them. The key ingredient of these protocols is to introduce adaptive refinement mechanisms, which first generate rough estimate by partial information and then establish refined estimate in subsequent steps guided by the rough estimate. The protocols leverage successive refinement, sample compression, thresholding and random hashing methods to achieve the optimal rates in different parameter regimes. The optimality of the protocols is shown by deriving compatible minimax lower bounds.

cs.LG↗

arXiv2024

VMambaMorph: a Multi-Modality Deformable Image Registration Framework based on Visual State Space Model with Cross-Scan Module

Image registration, a critical process in medical imaging, involves aligning different sets of medical imaging data into a single unified coordinate system. Deep learning networks, such as the Convolutional Neural Network (CNN)-based VoxelMorph, Vision Transformer (ViT)-based TransMorph, and State Space Model (SSM)-based MambaMorph, have demonstrated effective performance in this domain. The recent Visual State Space Model (VMamba), which incorporates a cross-scan module with SSM, has exhibited promising improvements in modeling global-range dependencies with efficient computational cost in computer vision tasks. This paper hereby introduces an exploration of VMamba with image registration, named VMambaMorph. This novel hybrid VMamba-CNN network is designed specifically for 3D image registration. Utilizing a U-shaped network architecture, VMambaMorph computes the deformation field based on target and source volumes. The VMamba-based block with 2D cross-scan module is redesigned for 3D volumetric feature processing. To overcome the complex motion and structure on multi-modality images, we further propose a fine-tune recursive registration framework. We validate VMambaMorph using a public benchmark brain MR-CT registration dataset, comparing its performance against current state-of-the-art methods. The results indicate that VMambaMorph achieves competitive registration quality. The code for VMambaMorph with all baseline methods is available on GitHub.

cs.CV↗

arXiv2024

Distributed Approximate Computing with Constant Locality

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed bits. We establish an achievable rate region by designing an efficient layered coding scheme, where the coding rate is reduced by introducing auxiliary random variables and local decoding is achieved by exploiting the expander graph code. Then we show the rate region is optimal under mild regularity conditions on source distributions. The proof relies on the reverse hypercontractivity and a rounding technique to construct auxiliary random variables. The rate region is strictly smaller than that for the classical problem without the constant locality constraint in most cases, which indicates that more rate is required in order to achieve lower coding complexity. Moreover, a coding for computing problem with side information is analogously studied. We also develop graph characterizations, which simplifies the computation of the achievable rate region.

cs.IT↗

arXiv2024

Quantum vortex phases of charged pion condensates induced by rotation in a magnetic field

Using the relativistic complex scalar field model with a repulsive self-interaction, we discuss the ground state structure of charged pion condensation under the coexistence of parallel rotation and magnetic field. Our previous study found that the density distribution profile of the condensates is a supergiant quantum vortex phase and change with rotational speed and coupling constant. In this work, we further discover vortex lattice structures in the condensates under conditions of small rotation and strong coupling constant. This mechanism can be thought of as electrical superconductivity: Vortex lattices are created to better adapt to changes in rotation and interaction. Furthermore, large rotation and weak coupling constant are more likely to cause the vortex lattices to be destroyed and form a giant quantum vortex similar to a doughnut. We expect this phenomenon can be observed in the relativistic non-central heavy ion collisions with large rotation and strong magnetic field.

hep-ph↗

arXiv2024

1DFormer: a Transformer Architecture Learning 1D Landmark Representations for Facial Landmark Tracking

Recently, heatmap regression methods based on 1D landmark representations have shown prominent performance on locating facial landmarks. However, previous methods ignored to make deep explorations on the good potentials of 1D landmark representations for sequential and structural modeling of multiple landmarks to track facial landmarks. To address this limitation, we propose a Transformer architecture, namely 1DFormer, which learns informative 1D landmark representations by capturing the dynamic and the geometric patterns of landmarks via token communications in both temporal and spatial dimensions for facial landmark tracking. For temporal modeling, we propose a recurrent token mixing mechanism, an axis-landmark-positional embedding mechanism, as well as a confidence-enhanced multi-head attention mechanism to adaptively and robustly embed long-term landmark dynamics into their 1D representations; for structure modeling, we design intra-group and inter-group structure modeling mechanisms to encode the component-level as well as global-level facial structure patterns as a refinement for the 1D representations of landmarks through token communications in the spatial dimension via 1D convolutional layers. Experimental results on the 300VW and the TF databases show that 1DFormer successfully models the long-range sequential patterns as well as the inherent facial structures to learn informative 1D representations of landmark sequences, and achieves state-of-the-art performance on facial landmark tracking.

cs.CV↗

arXiv2024

Sliding Secure Symmetric Multilevel Diversity Coding

Symmetric multilevel diversity coding (SMDC) is a source coding problem where the independent sources are ordered according to their importance. It was shown that separately encoding independent sources (referred to as ``\textit{superposition coding}") is optimal. In this paper, we consider an $(L,s)$ \textit{sliding secure} SMDC problem with security priority, where each source $X_α~(s\leq α\leq L)$ is kept perfectly secure if no more than $α-s$ encoders are accessible. The reconstruction requirements of the $L$ sources are the same as classical SMDC. A special case of an $(L,s)$ sliding secure SMDC problem that the first $s-1$ sources are constants is called the $(L,s)$ \textit{multilevel secret sharing} problem. For $s=1$, the two problems coincide, and we show that superposition coding is optimal. The rate regions for the $(3,2)$ problems are characterized. It is shown that superposition coding is suboptimal for both problems. The main idea that joint encoding can reduce coding rates is that we can use the previous source $X_{α-1}$ as the secret key of $X_α$. Based on this idea, we propose a coding scheme that achieves the minimum sum rate of the general $(L,s)$ multilevel secret sharing problem. Moreover, superposition coding of the $s$ sets of sources $X_1$, $X_2$, $\cdots$, $X_{s-1}$, $(X_s, X_{s+1}, \cdots, X_L)$ achieves the minimum sum rate of the general sliding secure SMDC problem.

cs.IT↗

arXiv2023

Investigation of the tetraquark states $Qq\bar{Q} \bar{q}$ in the improved chromomagnetic interaction model

In the framework of the improved chromomagnetic interaction model, we complete a systematic study of the $S$-wave tetraquark states $Qq\bar{Q}\bar{q}$ ($Q=c,b$, and $q=u,d,s$) with different quantum numbers, $J^{PC}=0^{+(+)}$, $1^{+(\pm)}$, and $2^{+(+)}$. The mass spectra of tetraquark states are predicted and the possible decay channels are analyzed by considering both the angular momentum and $\mathcal{C}$-parity conservation. The recently observed hidden-charm tetraquark states with strangeness, such as $Z_{cs}(3985)^-$, $X(3960)$, and $Z_{cs}(4220)^+$, can be well explained in our model. Besides, based on the wave function of each tetraquark state, we find that the low-lying states of each $Qq\bar{Q}\bar{q}$ configuration have a large overlap to the $Q\bar Q$ and $q\bar q$ meson basis, instead of $Q\bar q$ and $q\bar Q$ meson basis. This indicates one can search these tetraquark states in future experiments via the channel of $Q\bar Q$ and $q\bar q$ mesons.

hep-ph↗