SearcharxivSearch

arXiv subjects

Bin Deng

Publications and source records attributed to Bin Deng.

At least 19 recordsLinked to original sources

The Higher-Dimensional Nitsche Conjecture: Sharp Bounds and Rigidity

Let $n\ge3$ and let $h:\A(r,1)\to\A(R,1)\subset\mathbb R^n$ be an onto homeomorphism with harmonic coordinate functions. We prove the sharp Nitsche bound \[ R\le R_{n,+}(r):=\frac{nr}{n-1+r^n}, \] and, when $h$ interchanges the two ends, the strictly stronger sharp bound \[ R\le R_{n,-}(r):=\frac{nr^{n-1}}{1+(n-1)r^n}. \] Both critical cases are rigid: equality forces, up to an orthogonal transformation, the corresponding end-preserving or end-reversing radial harmonic homeomorphism. No continuous extension to the closed annulus, boundary homeomorphism, boundary Jacobian, or sign condition on the Jacobian is assumed. The proof converts the nonzero degree of each interior direction map into a probability coupling and establishes a sharp contraction principle for vector measures under positive zonal kernels, using the strict concavity of spherical-cap barycenters. At either critical value, a second-order endpoint defect forces equality for a limiting transfer kernel, whose equality classification yields an orthogonal coupling graph. The remaining trace is locked by a Dirichlet-to-Neumann spectral gap in the end-preserving case and by endpoint H\"older regularity and uniform convergence of the direction maps in the end-reversing case.

math.AP

Global Minimality and Rigidity of the Constraint Map Vortex

We consider the minimization problem \[ \min\left\{\int_{B_1}|Du|^2:\ u\in W^{1,2}(B_1;\mathbb R^n),\quad u=x\ \text{on }\partial B_1,\quad |u|\ge a\right\}, \quad 0<a<1. \] Figalli, Guerra, Kim, and Shahgholian proved that the canonical radial vortex is the unique global minimizer for $n\ge7$, and asked whether the same holds in dimensions \(3\le n \le6\). We answer this question affirmatively, thereby completing the global minimality and rigidity of the constraint map vortex in every dimension \(n\ge3\).

math.AP

Green function asymptotics for the $\sigma_2$-Yamabe problem

We establish, at every pole, the asymptotic expansion of the normalized $\Gamma_2$-Green function with a finite pole set in every dimension $n\ge5$. In dimensions $5\le n\le7$ the first correction is a unique nonnegative constant, whereas dimension $8$ exhibits a Weyl-driven $\sqrt{\log}$ term. For $n>8$ we construct the finite local curvature parametrix through the first positive indicial resonance and identify the first genuinely global coefficient by a relative Newton flux.

math.DG

Not All Patches are Equal: Sampling Matters for Visible-Infrared Pre-Training

Visible-infrared (VIS-IR) alignment is a key pre-training task for robust multi-sensor perception. Most existing methods use uniform patch-wise contrastive learning, but this can be unreliable in VIS-IR data because imaging-physics differences make some spatially paired regions inherently less comparable, and aligning them with equal strength hinders representation learning and downstream transfer. In this paper, we revisit VIS-IR pre-training from a sampling perspective and propose Importance-Aware Sampling (IAS), which adjusts training emphasis based on patch reliability. Specifically, IAS (i) derives patch weights from infrared structural cues and uses them to reweight the contrastive objective; (ii) learns a soft importance mask with a lightweight sampler, optionally warm-started from the hand-crafted prior; and (iii) employs a patch curriculum learning strategy that gradually expands from high-reliability regions to harder patches. It is worth noting that IAS is plug-and-play and works with both patch-/correlation-level alignment (e.g., UNIV-style) and image-level contrastive baselines (e.g., ImageBind-style). Extensive experiments on multiple VIS-IR benchmarks demonstrate consistent improvements over strong baselines, including for IR semantic segmentation, IR object detection and VIS semantic segmentation and cross-modal retrieval task. Code will be released on https://github.com/KlayMa527/IAS.

cs.CV

Blow-up phenomena for the $\sigma_2$-Yamabe equation

For every integer $n\ge27$, we construct a smooth metric on $\mathbb S^n$ that is invariant under the antipodal map and is not locally conformally flat. For this fixed background metric, the normalized $\sigma_2$-Yamabe equation admits a noncompact family of positive $\Gamma_2^+$-admissible solutions. The main difficulty is the possible loss of ellipticity of the linearized operator. This difficulty does not occur for the scalar Yamabe equation, whose linearization has a fixed Laplace-type principal part. In the $\sigma_2$ problem, the positive Newton tensor of a standard bubble decays in the far field, while the terms produced by the background metric need not decay at the same rate. Our construction provides the relative decay needed to keep the conformal metrics inside the ellipticity cone. A quartic profile in the finite-dimensional reduction yields the endpoint dimension $n=27$.

math.DG

Rotatable Antenna-array-enhanced Direction-sensing for Low-altitude Communication Network: Method and Performance

In a practical multi-antenna receiver, each element of the receive antenna array has a directive antenna pattern, which is still not fully explored and investigated in academia and industry until now. When the emitter is deviated greatly from the normal direction of antenna element or is close to the null-point direction, the sensing energy by array will be seriously attenuated such that the direction-sensing performance is degraded significantly. To address such an issue, a rotatable array system is established with the directive antenna pattern of each element taken into account, where each element has the same antenna pattern. Then, the corresponding the Cramer-Rao lower bound (CRLB) is derived. Finally, a recursive rotation Root-MUSIC (RR-Root-MUSIC) direction-sensing method is proposed and its root-mean-squared-error (RMSE) performance is evaluated by the derived CRLB. Simulation results show that the proposed rotation method converges rapidly with about ten iterations, and make a significant enhancement on the direction-sensing accuracy in terms of RMSE when the target direction departs seriously far away from the normal vector of array. Compared with conventional Root-MUSIC, the sensing performance of the proposed RR-Root-MUSIC method is much closer to the CRLB.

eess.SP

RETAIL: Towards Real-world Travel Planning for Large Language Models

Although large language models have enhanced automated travel planning abilities, current systems remain misaligned with real-world scenarios. First, they assume users provide explicit queries, while in reality requirements are often implicit. Second, existing solutions ignore diverse environmental factors and user preferences, limiting the feasibility of plans. Third, systems can only generate plans with basic POI arrangements, failing to provide all-in-one plans with rich details. To mitigate these challenges, we construct a novel dataset \textbf{RETAIL}, which supports decision-making for implicit queries while covering explicit queries, both with and without revision needs. It also enables environmental awareness to ensure plan feasibility under real-world scenarios, while incorporating detailed POI information for all-in-one travel plans. Furthermore, we propose a topic-guided multi-agent framework, termed TGMA. Our experiments reveal that even the strongest existing model achieves merely a 1.0% pass rate, indicating real-world travel planning remains extremely challenging. In contrast, TGMA demonstrates substantially improved performance 2.72%, offering promising directions for real-world travel planning.

cs.AI

DNN-based Methods of Jointly Sensing Number and Directions of Targets via a Green Massive H2AD MIMO Receiver

As a green MIMO structure, the heterogeneous hybrid analog-digital H2AD MIMO architecture has been shown to own a great potential to replace the massive or extremely large-scale fully-digital MIMO in the future wireless networks to address the three challenging problems faced by the latter: high energy consumption, high circuit cost, and high complexity. However, how to intelligently sense the number and direction of multi-emitters via such a structure is still an open hard problem. To address this, we propose a two-stage sensing framework that jointly estimates the number and direction values of multiple targets. Specifically, three target number sensing methods are designed: an improved eigen-domain clustering (EDC) framework, an enhanced deep neural network (DNN) based on five key statistical features, and an improved one-dimensional convolutional neural network (1D-CNN) utilizing full eigenvalues. Subsequently, a low-complexity and high-accuracy DOA estimation is achieved via the introduced online micro-clustering (OMC-DOA) method. Furthermore, we derive the Cram\'er-Rao lower bound (CRLB) for the H2AD under multiple-source conditions as a theoretical performance benchmark. Simulation results show that the developed three methods achieve 100\% number of targets sensing at moderate-to-high SNRs, while the improved 1D-CNN exhibits superior under extremely-low SNR conditions. The introduced OMC-DOA outperforms existing clustering and fusion-based DOA methods in multi-source environments.

eess.SP

Multi-Branch DNN and CRLB-Ratio-Weight Fusion for Enhanced DOA Sensing via a Massive H$^2$AD MIMO Receiver

As a green MIMO structure, massive H$^2$AD is viewed as a potential technology for the future 6G wireless network. For such a structure, it is a challenging task to design a low-complexity and high-performance fusion of target direction values sensed by different sub-array groups with fewer use of prior knowledge. To address this issue, a lightweight Cramer-Rao lower bound (CRLB)-ratio-weight fusion (WF) method is proposed, which approximates inverse CRLB of each subarray using antenna number reciprocals to eliminate real-time CRLB computation. This reduces complexity and prior knowledge dependence while preserving fusion performance. Moreover, a multi-branch deep neural network (MBDNN) is constructed to further enhance direction-of-arrival (DOA) sensing by leveraging candidate angles from multiple subarrays. The subarray-specific branch networks are integrated with a shared regression module to effectively eliminate pseudo-solutions and fuse true angles. Simulation results show that the proposed CRLB-ratio-WF method achieves DOA sensing performance comparable to CRLB-based methods, while significantly reducing the reliance on prior knowledge. More notably, the proposed MBDNN has superior performance in low-SNR ranges. At SNR $= -15$ dB, it achieves an order-of-magnitude improvement in estimation accuracy compared to CRLB-ratio-WF method.

eess.SP

The conformal limit for bimerons in easy-plane chiral magnets

We study minimizers $\boldsymbol{m}\colon \mathbb R^2\to\mathbb S^2$ of the energy functional \begin{align*} E_\sigma(\boldsymbol{m}) = \int_{\mathbb R^2} \bigg(\frac 12 |\nabla\boldsymbol{m}|^2 +\sigma^2 \boldsymbol{ m} \cdot \nabla \times\boldsymbol{m} +\sigma^2 m_3^2 \bigg)\, dx\,, \end{align*} for $0<\sigma\ll 1$, with prescribed topological degree \begin{align*} Q(\boldsymbol{m})=\frac{1}{4\pi} \int_{\mathbb R^2}\boldsymbol{m} \cdot \partial_1 \boldsymbol{m}\times\partial_2\boldsymbol{m}\, dx =\pm 1\,. \end{align*} This model arises in thin ferromagnetic films with Dzyaloshinskii-Moriya interaction and easy-plane anisotropy, where these minimizers represent bimeron configurations. We prove their existence, and describe them precisely as perturbations of specific M\"obius maps: we establish in particular that they are localized at scale of order $1/|\ln(\sigma^2)|$. The proof follows a strategy introduced by Bernand-Mantel, Muratov and Simon (Arch. Ration. Mech. Anal., 2021) for a similar model with easy-axis anisotropy, but requires several adaptations to deal with the less coercive easy-plane anisotropy and different symmetry properties.

math.AP

Fast High-Quality Enhanced Imaging Algorithm for Layered Dielectric Targets Based on MMW MIMO-SAR System

Millimeter-wave (MMW) multiple-input multiple-output synthetic aperture radar (MIMO-SAR) system is a technology that can achieve high resolution, high frame rate, and all-weather imaging and has received extensive attention in the non-destructive testing and internal imaging applications of layered dielectric targets. However, the non-ideal scattering effect caused by dielectric materials can significantly deteriorate the imaging quality when using the existing MIMO-SAR fast algorithms. This paper proposes a rapid, high-quality dielectric target-enhanced imaging algorithm for a new universal non-uniform MIMO-SAR system. The algorithm builds on the existing non-uniform MIMO-SAR dielectric target frequency-domain algorithm (DT-FDA) by constructing a forward sensing operator and incorporating it into the alternating direction method of multipliers (ADMM) framework. This approach avoids large matrix operations while maintaining computational efficiency. By integrating an optimal regularization parameter search, the algorithm enhances the image reconstruction quality of dielectric internal structures or defects. Experimental results show the proposed algorithm outperforms IBP and DT-FDA, achieving better focusing, sidelobe suppression, and 3D imaging accuracy. It yields the lowest image entropy (8.864) and significantly improves efficiency (imaging time: 15.29 s vs. 23295.3 s for IBP).

eess.SP

Which Channel in 6G, Low-rank or Full-rank, more needs RIS from a Perspective of DoF?

Reconfigurable intelligent surface (RIS), as an efficient tool to improve receive signal-to-noise ratio, extend coverage and create more spatial diversity, is viewed as a most promising technique for the future wireless networks like 6G. As you know, RIS is very suitable for a special wireless scenario with wireless link between BS and users being completely blocked, i.e., no link. In this paper, we extend its applications to a general scenario, i.e., rank-deficient channel, particularly some extremely low-rank ones such as no link, and line-of-sight (LoS, rank-one). Actually, there are several potential important low-rank applications like low-altitude, satellite, UAV, marine, and deep-space communications. In such a situation, it is found that RIS may make a dramatic degrees of freedom (DoF) enhancement over no RIS. By using a distributed RISs placement, the DoF of channel from BS to user in LoS channel may be even boosted from a low-rank like 0/1 to full-rank. This will achieve an extremely rate improvement via spatial parallel multiple-stream transmission from BS to user. In this paper, we present a complete review of making an in-depth discussion on DoF effect of RIS.

eess.SP

Uni-ELF: A Multi-Level Representation Learning Framework for Electrolyte Formulation Design

Advancements in lithium battery technology heavily rely on the design and engineering of electrolytes. However, current schemes for molecular design and recipe optimization of electrolytes lack an effective computational-experimental closed loop and often fall short in accurately predicting diverse electrolyte formulation properties. In this work, we introduce Uni-ELF, a novel multi-level representation learning framework to advance electrolyte design. Our approach involves two-stage pretraining: reconstructing three-dimensional molecular structures at the molecular level using the Uni-Mol model, and predicting statistical structural properties (e.g., radial distribution functions) from molecular dynamics simulations at the mixture level. Through this comprehensive pretraining, Uni-ELF is able to capture intricate molecular and mixture-level information, which significantly enhances its predictive capability. As a result, Uni-ELF substantially outperforms state-of-the-art methods in predicting both molecular properties (e.g., melting point, boiling point, synthesizability) and formulation properties (e.g., conductivity, Coulombic efficiency). Moreover, Uni-ELF can be seamlessly integrated into an automatic experimental design workflow. We believe this innovative framework will pave the way for automated AI-based electrolyte design and engineering.

physics.chem-ph

A Pre-trained Deep Potential Model for Sulfide Solid Electrolytes with Broad Coverage and High Accuracy

Solid electrolytes with fast ion transport are one of the key challenges for solid state lithium metal batteries. To improve ion conductivity, chemical doping has been the most effective strategy, and atomistic simulation with machine-learning potential helps find optimized doping by predicting ion conductivity for arbitrary composition. Yet most existing machine-learning models are trained on narrow chemistry, and new model has to be trained for each system, wasting transferable knowledge and incurring significant cost. Here, we propose a pre-trained deep potential model purpose-built for sulfide electrolytes with attention mechanism, known as DPA-SSE. The training set encompasses 15 elements and consists of both equilibrium and extensive out-of-equilibrium configurations. DPA-SSE achieves a high energy resolution of less than 2 meV/atom for dynamical trajectories up to 1150 K, and reproduces experimental ion conductivity of sulfide electrolytes with remarkable accuracy. DPA-SSE exhibits good transferability, covering a range of complex electrolytes with mixes of cation and anion atoms. Highly efficient dynamical simulation with DPA-SSE can be realized by model distillation which generates a faster model for given systems. DPA-SSE also serves as a platform for continuous learning, and the model fine-tune requires only a portion of downstream data. These results demonstrate the possibility of a new pathway for AI-driven development of solid electrolytes with exceptional performance.

physics.chem-ph

A Spin-dependent Machine Learning Framework for Transition Metal Oxide Battery Cathode Materials

Owing to the trade-off between the accuracy and efficiency, machine-learning-potentials (MLPs) have been widely applied in the battery materials science, enabling atomic-level dynamics description for various critical processes. However, the challenge arises when dealing with complex transition metal (TM) oxide cathode materials, as multiple possibilities of d-orbital electrons localization often lead to convergence to different spin states (or equivalently local minimums with respect to the spin configurations) after ab initio self-consistent-field calculations, which causes a significant obstacle for training MLPs of cathode materials. In this work, we introduce a solution by incorporating an additional feature - atomic spins - into the descriptor, based on the pristine deep potential (DP) model, to address the above issue by distinguishing different spin states of TM ions. We demonstrate that our proposed scheme provides accurate descriptions for the potential energies of a variety of representative cathode materials, including the traditional Li$_x$TMO$_2$ (TM=Ni, Co, Mn, $x$=0.5 and 1.0), Li-Ni anti-sites in Li$_x$NiO$_2$ ($x$=0.5 and 1.0), cobalt-free high-nickel Li$_x$Ni$_{1.5}$Mn$_{0.5}$O$_4$ ($x$=1.5 and 0.5), and even a ternary cathode material Li$_x$Ni$_{1/3}$Co$_{1/3}$Mn$_{1/3}$O$_2$ ($x$=1.0 and 0.67). We highlight that our approach allows the utilization of all ab initio results as a training dataset, regardless of the system being in a spin ground state or not. Overall, our proposed approach paves the way for efficiently training MLPs for complex TM oxide cathode materials.

cond-mat.mtrl-sci

Universal Domain Adaptation from Foundation Models: A Baseline Study

Foundation models (e.g., CLIP or DINOv2) have shown their impressive learning and transfer capabilities in a wide range of visual tasks, by training on a large corpus of data and adapting to specific downstream tasks. It is, however, interesting that foundation models have not been fully explored for universal domain adaptation (UniDA), which is to learn models using labeled data in a source domain and unlabeled data in a target one, such that the learned models can successfully adapt to the target data. In this paper, we make comprehensive empirical studies of state-of-the-art UniDA methods using foundation models. We first observe that, unlike fine-tuning from ImageNet pre-trained models, as previous methods do, fine-tuning from foundation models yields significantly poorer results, sometimes even worse than training from scratch. While freezing the backbones, we demonstrate that although the foundation models greatly improve the performance of the baseline method that trains the models on the source data alone, existing UniDA methods generally fail to improve over the baseline. This suggests that new research efforts are very necessary for UniDA using foundation models. Based on these findings, we introduce \textit{CLIP distillation}, a parameter-free method specifically designed to distill target knowledge from CLIP models. The core of our \textit{CLIP distillation} lies in a self-calibration technique for automatic temperature scaling, a feature that significantly enhances the baseline's out-class detection capability. Although simple, our method outperforms previous approaches in most benchmark tasks, excelling in evaluation metrics including H-score/H$^3$-score and the newly proposed universal classification rate (UCR) metric. We hope that our investigation and the proposed simple framework can serve as a strong baseline to facilitate future studies in this field.

cs.LG

Adversarial Style Augmentation for Domain Generalization

It is well-known that the performance of well-trained deep neural networks may degrade significantly when they are applied to data with even slightly shifted distributions. Recent studies have shown that introducing certain perturbation on feature statistics (\eg, mean and standard deviation) during training can enhance the cross-domain generalization ability. Existing methods typically conduct such perturbation by utilizing the feature statistics within a mini-batch, limiting their representation capability. Inspired by the domain generalization objective, we introduce a novel Adversarial Style Augmentation (ASA) method, which explores broader style spaces by generating more effective statistics perturbation via adversarial training. Specifically, we first search for the most sensitive direction and intensity for statistics perturbation by maximizing the task loss. By updating the model against the adversarial statistics perturbation during training, we allow the model to explore the worst-case domain and hence improve its generalization performance. To facilitate the application of ASA, we design a simple yet effective module, namely AdvStyle, which instantiates the ASA method in a plug-and-play manner. We justify the efficacy of AdvStyle on tasks of cross-domain classification and instance retrieval. It achieves higher mean accuracy and lower performance fluctuation. Especially, our method significantly outperforms its competitors on the PACS dataset under the single source generalization setting, \eg, boosting the classification accuracy from 61.2\% to 67.1\% with a ResNet50 backbone. Our code will be available at \url{https://github.com/YBZh/AdvStyle}.

cs.CV

Counterfactual Supervision-based Information Bottleneck for Out-of-Distribution Generalization

Learning invariant (causal) features for out-of-distribution (OOD) generalization has attracted extensive attention recently, and among the proposals invariant risk minimization (IRM) is a notable solution. In spite of its theoretical promise for linear regression, the challenges of using IRM in linear classification problems remain. By introducing the information bottleneck (IB) principle into the learning of IRM, IB-IRM approach has demonstrated its power to solve these challenges. In this paper, we further improve IB-IRM from two aspects. First, we show that the key assumption of support overlap of invariant features used in IB-IRM is strong for the guarantee of OOD generalization and it is still possible to achieve the optimal solution without this assumption. Second, we illustrate two failure modes that IB-IRM (and IRM) could fail for learning the invariant features, and to address such failures, we propose a \textit{Counterfactual Supervision-based Information Bottleneck (CSIB)} learning algorithm that provably recovers the invariant features. By requiring counterfactual inference, CSIB works even when accessing data from a single environment. Empirical experiments on several datasets verify our theoretical results.

cs.LG