Searcharxiv⌕ Search

arXiv subjects

Ying Wang

Publications and source records attributed to Ying Wang.

At least 37 records · Page 2Linked to original sources

DisKO: Deep Koopman Learning in Distribution Space from Unpaired Snapshots

Many complex systems are observed only through temporally unpaired distribution snapshots, making trajectory-based dynamical learning difficult without additional assumptions. We therefore formulate the problem directly in distribution space, treating the distribution itself as the dynamical state. The challenge is that distribution space is infinite-dimensional, making compact and approximately closed representations difficult to learn from finite snapshots. We introduce DisKO, which extends deep Koopman learning to distribution dynamics by jointly learning predictive distributional observables, a finite-dimensional Koopman representation, and a generative map back to the full distribution. Across seven diverse benchmarks, DisKO achieves state-of-the-art extrapolation performance, with substantially slower error accumulation on long-horizon prediction tasks. DisKO further recovers leading Koopman eigenvalues and eigenfunctions on systems with analytic spectra, revealing meaningful dynamical structure in the learned representation.

cs.LG↗

How Far Are We from Removing the Visual Encoder? Scaling Laws for Encoder-Free Multimodal Pretraining

Most modern multimodal large language models (MLLMs) build on a pretrained visual encoder that provides a strong visual prior. Encoder-free MLLMs instead learn visual representations directly from raw pixels, offering a simple and unified architecture, but their scaling behavior has not been systematically characterized. To fill this gap, we compare scaling laws for encoder-free and encoder-based MLLMs and report three main findings: (1) Removing the visual encoder shifts the compute-optimal allocation for the multimodal objective toward larger models, while leaving that for text nearly unchanged. (2) The two architectures exhibit nearly overlapping loss--compute frontiers on the text objective, but diverge on the multimodal objective: encoder-free models underperform at small scales yet are predicted to catch up at around $10^{22}$ FLOPs, well within practical pretraining budgets. (3) Without a visual encoder, the language model learns to take over its role via vision-specific adaptation: bidirectional interactions among visual tokens become increasingly beneficial as training compute grows, visual processing shifts toward earlier layers, and expert routing for visual tokens becomes more concentrated. Overall, our results indicate that the advantage of the visual prior provided by a pretrained encoder diminishes with scale, positioning encoder-free architectures as a promising direction for multimodal pretraining.

cs.CV↗

Turning-Point Count Discrepancy as a Diagnostic of Relativistic Orbital Chaos

We propose the turning-point count-discrepancy indicator (TPCD) for diagnosing orbital chaos from a single trajectory in relativistic Hamiltonian systems with two oscillatory degrees of freedom. TPCD measures the largest cumulative departure of one turning-event count from its mean rate per reference cycle, requiring neither a neighboring orbit nor a phase-space partition and applying to both massive particles and photons. We establish its long-time behavior under explicit event--phase assumptions. Rigid phases with an exact event--phase correspondence obey a strict discrepancy bound of unity, and linearizable regular tori with bounded degree-one phase deformations obey a finite, orbit-dependent bound; both imply that the normalized indicator decays to zero as the record grows. A diffusive fluctuation mechanism instead yields a Brownian-bridge scaling and a finite statistical scale. Integrable Kerr motion validates the construction, recovering prescribed frequency ratios from event counts to within $2.6\times10^{-5}$ for six targets, including an irrational ratio. In charged-particle scans around a Kerr black hole in an external test magnetic field, TPCD and the fast Lyapunov indicator agree for all 80 sampled trajectories. In the Schwarzschild--Melvin photon model, a trajectory with elevated finite-time TPCD but low fast-Lyapunov values is identified as regular once its indicator trends downward over an extended integration, showing that finite-time values must be read together with their long-time trend.

gr-qc↗

Counterexamples to the Mu--Welker recursive decomposition in every degree

The well-known open problem of Bell and Skandera asks whether a real-rooted polynomial $f(t)$ with positive integer coefficients and constant term one is the $f$-polynomial of a simplicial complex. Mu and Welker proved that if the recursive decomposition $f(t)=g(t)+th(t)$ satisfies the corresponding coefficient inequality $h_i<g_i$, then this open problem has an affirmative answer. Mu and Welker also conjectured that the real-rootedness of $f(t)$ implies that of $g(t)$ and $h(t)$. We give counterexamples to the conjecture of Mu and Welker for every degree at least three, and prove that the assertion holds in degrees $1$ and $2$. Moreover, each polynomial we construct is the $f$-polynomial of a simplicial complex.

math.CO↗

A Tutorial on Movable Antenna-Enabled ISAC Systems: Fundamentals, Parameter Estimation, and Security Issues

Movable antenna (MA) technology has recently emerged as a promising paradigm for enhancing the flexibility and performance of wireless systems by allowing antennas to dynamically adjust their spatial positions within a confined region. Meanwhile, integrated sensing and communication (ISAC) has attracted significant attention as a key technology for next-generation wireless networks, aiming to integrate communication and sensing within a shared hardware and spectral framework. By leveraging the additional spatial degrees of freedom offered by MA, MA-enabled ISAC systems provide new opportunities to enhance both communication performance and sensing accuracy. However, the integration of MA into ISAC also poses new challenges in parameter estimation and security. In this tutorial, we provide a comprehensive overview of MA-enabled ISAC systems, with a particular focus on their fundamentals, parameter estimation, and security issues. First, we introduce the basic principles of MA and ISAC, and review representative MA-enabled ISAC systems and their potential applications. Then, we establish unified mathematical models for communication and sensing, and systematically review representative channel and sensing parameter estimation methods tailored to MA-enabled ISAC systems. Numerical comparisons are provided to illustrate the characteristics and performance of different estimation methods. Furthermore, we investigate the security issues of MA-enabled ISAC systems, introduce the fundamentals of physical-layer security (PLS), and summarize how the spatial reconfigurability of MAs can be exploited to enhance the security of ISAC systems. Representative case studies are presented to demonstrate the performance gains of MA-enabled secure ISAC systems. Finally, we identify several open issues and future research directions toward practical MA-enabled ISAC systems.

eess.SP↗

Dirichlet Eigenvalues for the Logarithmic-Hardy operator

In this paper, we study the Dirichlet eigenvalue problem for the logarithmic Hardy operator, defined as the logarithmic Laplacian with a critical logarithmic potential, in a bounded Lipschitz domain containing the origin. We first establish a logarithmic Hardy inequality and use it to identify the associated energy space, showing that the embedding into \(L^2\) is compact when the perturbation parameter exceeds the endpoint value \(-1\), but fails to be compact at that endpoint. For parameters above \(-1\), we develop a complete variational spectral theory, prove that the problem admits a discrete sequence of eigenvalues tending to infinity, characterized by successive minimizations over orthogonal complements, whose eigenfunctions form a complete orthonormal basis of \(L^2\). We further establish a uniform lower bound for the first eigenvalue, a scaling property under domain dilation that determines a critical radius for the sign of the first eigenvalue and leaves the eigenvalue gaps invariant.

math.AP↗

A System Architecture for Low Latency Multiprogramming Quantum Computing

As quantum systems scale, multiprogramming quantum computing (MPQC) provides a practical way to improve device utilization and throughput. However, because quantum executables are device-dependent, non-portable across qubit regions, and highly susceptible to noise and crosstalk, current MPQC pipelines rely on expensive online compilation to co-optimize concurrently running programs. This online step dominates runtime and impedes low-latency deployments for practical, real-world workloads in the future, such as repeatedly invoked quantum neural network (QNN) services. We present FLAMENCO, a fidelity-aware multi-version compilation system that enables independent offline compilation and low-latency multiprogramming at runtime. \textbf{At the architecture level}, the system abstracts devices into compute units to reduce the search space of region allocation. \textbf{At compile time}, it generates diverse executable versions for each program---each bound to a distinct qubit region---allowing dynamic region selection at runtime and overcoming non-portability. \textbf{At runtime}, it employs a lightweight orchestrator that uses post-compilation fidelity metrics to avoid conflicts and mitigate crosstalk, supporting conflict-free co-execution without online co-optimization. Evaluations show that FLAMENCO achieves over 5$\times$ runtime speedup in post-scheduling execution while maintaining comparable execution fidelity on common-success workloads. When integrated into existing scheduler-coupled systems, it raises workload-level conflict-free orchestration ratio from 0.183 to 1.000 for HyperQ and from 0.050 to 0.400 for QOS.

cs.AR↗

ASTRA: Toward Agentic AI for Intelligent Device-Network-Cloud Synergy in Next-Generation Mobile Communication

The evolution toward next-generation mobile communication systems demands intelligence-native networks capable of autonomously adapting to user intent, yet the prevailing 3GPP protocol-driven device-network-cloud (DNC) architecture imposes three structural bottlenecks: protocol-constrained decision spaces confining optimization to predefined parameter subsets, cascaded information asymmetry from lossy interface compression that strips semantic context and causes intent miscalibration, and inherently reactive coordination mechanisms that trigger actions only after performance degradation. This paper proposes an autonomous agentic AI paradigm named Agentic Synergy for Telecommunication Resource Autonomy (ASTRA), which introduces a three-tier agent layer, including device agent, network agent, and cloud agent, decoupling network intelligence from the underlying hardware infrastructure. These agents collaborate through bidirectional semantic channels, including semantic intent messages, capability abstraction messages, global directives, and peer coordination, executing a six-phase cycle of perceive, reason and predict, communicate, decide, act, and learn that transforms reactive protocol-driven operations into proactive, intent-calibrated optimization over the full decision space. Validated through system-level simulations in two representative scenarios, ASTRA achieves a 13.1\% average throughput gain in dense-crowd cell selection by redistributing UEs from congested cells via semantic load exchange, and an 18.2\% passive handover reduction in high-speed mobility through predictive trajectory-aware coordination, providing initial evidence that the proposed agentic framework accesses solution regions structurally inaccessible under protocol-constrained architectures.

cs.ET↗

Voltage-Current-Emission Framework of Time-Resolved Electroluminescence

Time-resolved electroluminescence has been a central methodology in the development of LED devices. However, it still lacks quantitative theoretical descriptions of time-resolved electroluminescence. By combining the equivalent circuit models of semiconductor devices and the carrier dynamics of electroluminescence processes, we here developed a Voltage-Current-Emission framework to illustrate time-resolved electroluminescence from the pulse voltage as input, to injection current and finally generate electroluminescence as output. The features of different LED devices can be quantitatively interpreted, confirming the universal applicability across LEDs with different materials and device structures. Importantly, the curves of time-resolved electroluminescence can be simulated to quantitatively describe the dynamics of current and carriers of LED operation. In all, the Voltage-Current-Emission framework offers theoretical guidance for achieving advanced LED devices for AI technology.

physics.optics↗

Joint Beamforming Optimization and Dynamic Tracking in RIS-Enabled Secure ISAC Systems

This paper investigates a reconfigurable intelligent surface (RIS)-enabled secure integrated sensing and communication (ISAC) system, where the direct links between the base station (BS) and users are blocked and a mobile eavesdropper is treated as both a potential wiretapper and a sensing target. The time-varying eavesdropper state leads to dynamically changing wiretap channels, which may degrade the effectiveness of conventional transmission designs based on outdated eavesdropper information. To address this issue, the BS tracks the eavesdropper over consecutive time slots and exploits the predicted state information to adapt secure transmission. An optimization problem is formulated to maximize the sum secrecy rate by jointly designing the BS beamforming, artificial noise, and the RIS reflection coefficients for secure transmission and echo sensing. Meanwhile, an error-covariance constraint is imposed to guarantee the required tracking accuracy. To solve the nonconvex and temporally coupled problem, we propose an optimization algorithm integrating the extended Kalman filter (EKF) and block coordinate optimization framework, in which the eavesdropper state is recursively predicted and updated, while the joint design problem is decomposed into four tractable subproblems. Simulation results demonstrate that compared with benchmark schemes, the proposed algorithm can better guarantee the secrecy rate and effectively track the moving trajectory of the eavesdropper.

eess.SP↗

GML-Based Optimization for Movable Antenna Wireless Networks: Challenges and Opportunities

Movable antenna (MA) is proposed as an emerging technology for future wireless networks. By leveraging the additional spatial degrees of freedom, MA can proactively reshape the wireless propagation environment, thereby enhancing network performance.However, fully unlocking the potential of MA networks necessitates the joint optimization of MA antenna positioning and beamforming. For this non-convex and highly coupled problem, existing solutions exhibit significant limitations. Therefore, this paper proposes a gradient-based meta learning (GML) optimization framework. Specifically, we first elaborate on the hardware architecture and channel characteristics of MA, based on which we analyze the primary challenges in optimizing MA wireless networks. Subsequently, we introduce the fundamental logic of the GML framework and compare it with existing methods. Furthermore, we discuss the constraint handling strategies for applying the proposed optimization framework to MA networks. A specific case is studied to show the performance of proposed framework based on numerical simulation. Finally, this paper outlines future research directions for both the GML framework and MA wireless networks.

eess.SP↗

Discrete Antenna Positioning and Beamforming Design for RIS-Assisted MA Secure ISAC Systems

This paper investigates a reconfigurable intelligent surface (RIS)-assisted movable antenna (MA) secure integrated sensing and communication (ISAC) system. In this architecture, the RIS establishes indirect transmission links to provide communication services for multiple legitimate users, while the high spatial diversity gain of MA is leveraged to enhance system security. Then, we formulate an optimization problem to maximize the system total secrecy rate by jointly optimizing the MA position selection, active beamforming design for base station and passive beamforming design for RIS. The problem also accounts for practical constraints including transmit power budget, sensing beampattern mean square error (MSE), RIS unit-modulus constraint. However, it is challenging to solve this problem due to its non-convexity and strong coupling of the optimization variables. Consequently, we propose an alternating optimization (AO) framework, employing techniques including discrete binary particle swarm optimization (BPSO), successive convex approximation (SCA) and difference-of-convex (DC) programming to transform the optimization problem into convex subproblems. Based on the solution above, the convex sub-problems are solved iteratively until convergence is achieved. Numerical results demonstrate that the proposed algorithm outperforms other baseline algorithms in terms of secure communication performance.

eess.SP↗

Blow-up or grow-up for the focusing 3D cubic NLS with a repulsive inverse-power potential at the mass--energy threshold

We consider the focusing cubic nonlinear Schrodinger equation with a repulsive inverse-power potential $V(x)=a|x|^{-μ}$, where $a>0$ and $1<μ\leq 2$. At the mass-energy threshold, Miao, Murphy, and Zheng, as well as Ardila, Hamano, and Ikeda, established sharp scattering results in the positive virial region. In this paper, we continue to study the dynamics in the negative virial region and show that, in each time direction, solutions either blow up in finite time or grow up.

math.AP↗

Hybrid Physics-AI Framework of Body Center of Mass Dynamics from Wrist-Worn Sensors

Wrist-worn IMU has been widely used for daily-life health monitoring. Yet, it does not fully represent whole-body dynamics, for which the body center of mass (COM) is considered the physiological reference standard. Therefore, this work proposes a simplified kinematic model (KM), which is designed to map the wrist IMU to the COM acceleration. It is built upon several reductive assumptions that enable the solvability of the dynamic equations based on wrist IMU measurements alone. This work further proposes three types of hybrid AI modeling methods, namely human kinematic model-based neural network (HKM-NN) models, to leverage the power of both grey-box and black-box modeling. The HKM-NN methods include serial learning (ser-) and two approaches of simultaneous learning (sim1- and sim2-). The proposed models are trained and tested using our dataset, which includes wrist IMU measurements and ground-truth COM measurements from 10 healthy volunteers during six gait activities and sit-to-stand (SS) transitional movement. The results demonstrate the feasibility of estimating COM acceleration from wrist IMU measurements. Our KM model yields satisfactory results, with an error ranging from 6.7% to 12.5% for gait activities and 5.6% for the SS. In comparison with the KM model, our HKM-NN models significantly enhance the performance, achieving 5.3% to 9.3% errors for gait activities, and the best error of 3.9% for the SS. In addition, the HKM-NN models demonstrate distinct robustness characteristics under noisy test conditions, with sim1-/sim2- generally maintaining greater robustness under Gaussian perturbations, while the KM model exhibits comparatively strong robustness under salt-and-pepper noise. These findings highlight the importance of combining biomechanical structure with data-driven learning for wearable sensing applications operating under imperfect and noisy measurement conditions.

cs.AI↗

Dual-Layer Over-the-Air Federated Learning in LEO Satellite Networks: Architecture, Key Technologies and Applications

Low Earth orbit (LEO) satellite networks are emerging as a pivotal infrastructure for global edge intelligence. In this context, integrating over-the-air (OTA) computation with adaptive beam hopping (BH) provides an innovative framework that seamlessly merges physical-layer analog aggregation with dynamic resource orchestration. This effectively overcomes the stringent bandwidth and power constraints of space platforms while extending federated learning (FL) to pervasive Internet-of-things (IoT) deployments. In this article, we first outline the fundamental principles of the dual-layer OTA model and introduce the adaptive BH mechanism designed for time-varying topologies. Then, we summarize the distinct advantages of this learning-centric architecture, which include decoupling aggregation latency from device density, optimizing spatio-temporal resource efficiency, and balancing data freshness with channel quality. Several application scenarios are explored to highlight the framework's potential across diverse vertical industries. Furthermore, a specific case is studied to demonstrate the practical efficacy of the proposed scheduling policy. The results reveal substantial performance gains in terms of model convergence speed and data utilization for satellite-based FL systems. Finally, we discuss the implementation challenges and outline future research directions, aiming to provide insights for the evolution of ubiquitous non-terrestrial intelligence.

eess.SP↗

QROB: Quantifying Realization Overhead in Quantum Compilation via Reverse Construction

Quantum compilation reconciles a program's idealized interaction topology with hardware locality constraints, yet evaluations at scale lack calibrated references for realization overhead. We present QROB, a scalable reverse-construction methodology that generates compilation instances backward from directly realizable configurations, retaining the inverse paths as feasible, compiler-independent references. QROB provides a common evaluation substrate for NISQ SWAP routing and fault-tolerant lattice-surgery scheduling, while extending its reference-preserving principle to capacity-constrained quantum memory-access scheduling. Across systems ranging from 9 to 156 qubits, evaluations highlight QROB's utility as both a diagnostic benchmark and a data source. First, for compiler characterization, QROB reveals substantial realization gaps in existing tools, with NISQ compilers incurring up to 24.1x the reference SWAP cost and fault-tolerant compilers requiring up to 7.0x the reference makespan. Second, as a supervision source for data-driven compilation, a router trained on QROB references outperforms Qiskit SABRE on 84.8% of real-world application circuits. Finally, on real hardware, QROB reference realizations achieve a median mirror-circuit survival rate 1.65x that of full Qiskit O3 compilations across three 156-qubit IBM Heron-r2 processors, demonstrating that closing algorithmic compilation gaps translates directly into physical fidelity gains.

quant-ph↗

Movable Antennas Enabled Wireless Powered Networks: Principles and Technologies

As an emerging framework, movable antenna (MA)-enabled wireless powered networks (WPNs) have attracted growing attention. WPNs integrate wireless communication and energy transfer. MA can dynamically adjust the position of antenna units by introducing additional spatial degrees of freedom, so as to make full use of channel gain, optimize the effect of energy beamforming, and further improve the performance of WPNs. In this article, we first classify the implementations of MA, and review the fundamental principles of WPNs. We then highlight the key advantages of MA-enabled WPNs in enhancing wireless power transfer efficiency, realizing flexible and adaptive beamforming, and improving system robustness and interference resilience. Furthermore, four representative application scenarios and three key enabling technologies are discussed. A case study is also presented to show the improvement of energy harvesting performance brought by MA for WPNs. Finally, we discuss the challenges and future directions of MA-enabled WPNs, aiming to provide reference for future research and practice.

cs.NI↗

Bayes Estimators with Performance Comparable to Empirical Bayes Estimators and Improved Local Robustness

Bayes estimation has been extensively studied and widely used in statistics, decision theory, signal processing, machine learning, and system identification. Among its variants, empirical Bayes (EB) estimation has attracted considerable attention due to its favorable estimation performance and computational tractability. However, the direct plug-in dependence of an EB estimator on hyperparameters can make it locally sensitive to hyper-parameter perturbations. This paper considers the linear regression model and focuses on the EB estimator by employing the marginal maximum likelihood hyper-parameter estimator. For conciseness, this estimator is simply referred to as the EB estimator. Given a family of EB weighting functions, a generalized Bayes estimator is constructed with the same excess mean squared error (XMSE) as the corresponding EB estimator. Here, the XMSE is a second-order asymptotic measure of the mean squared error difference between the estimator of interest and the maximum likelihood estimator. Furthermore, the EB estimator is shown to be at most firstorder sensitive to hyper-parameter perturbations, whereas the constructed Bayes estimator is at most second-order sensitive, making it locally more robust. The computational complexities of these two estimators are also analyzed. In some cases, the constructed Bayes estimator can be computationally comparable to, or more efficient than, the EB estimator. These theoretical results are further supported by numerical simulations.

stat.ME↗