arXiv subjects

Haiyan Jiang

Publications and source records attributed to Haiyan Jiang.

15 recordsLinked to original sources

arXiv2026

Omnidirectional photonic chiral flatband in nonlocal membrane metasurfaces

Omnidirectional flat-band resonances, characterized by an enhanced photonic density of states and inherent angular robustness, are highly sought-after in integrated nanophotonic devices, particularly when integrated with chiral functionality. Here we realize such resonances in a nonlocal silicon membrane metasurface patterned with periodic square-lattice air-hole arrays. Increasing the lattice period not only compresses the Brillouin zone but, crucially, weakens the evanescent coupling between neighbouring Bloch modes associated with the same-order guided resonances. Driven by the tight-binding model in the limit of weak inter-unit-cell coupling, the pronounced band flattening of the degenerate guided resonance along both $k_{x}$ and $k_{y}$ yields, giving rise to an omnidirectional flat-band resonance. Remarkably, both numerical simulations and experiments reveal a universal route for endowing flat-band guided resonances with optical chirality through the deliberate breaking of the mirror symmetry of air holes. As a result, the omnidirectional chiral flat-band resonance emerges along both principal in-plane directions, with $Q$-factors exceeding 10$^{3}$ and circular dichroism greater than 0.9 over a wide angular range of $\pm 5^{\circ}$. Nonlinear measurements further show that the resulting resonance not only drives highly efficient third-harmonic generation but also imparts a pronounced spin-selective character to the nonlinear process. Simultaneously, the highly efficient nonlinear process also enables chirality-controlled frequency-upconversion imaging. Our results establish a general paradigm for engineering omnidirectional chiral flat-band resonances in planar silicon platforms, opening new opportunities for nonlinear nanophotonics and chiral imaging.

physics.optics↗

arXiv2026

HOG-Layout: Hierarchical 3D Scene Generation, Optimization and Editing via Vision-Language Models

3D layout generation and editing play a crucial role in Embodied AI and immersive VR interaction. However, manual creation requires tedious labor, while data-driven generation often lacks diversity. The emergence of large models introduces new possibilities for 3D scene synthesis. We present HOG-Layout that enables text-driven hierarchical scene generation, optimization and real-time scene editing with large language models (LLMs) and vision-language models (VLMs). HOG-Layout improves scene semantic consistency and plausibility through retrieval-augmented generation (RAG) technology, incorporates an optimization module to enhance physical consistency, and adopts a hierarchical representation to enhance inference and optimization, achieving real-time editing. Experimental results demonstrate that HOG-Layout produces more reasonable environments compared with existing baselines, while supporting fast and intuitive scene editing.

cs.CV↗

arXiv2025

LoDAvatar: Hierarchical Embedding and Selective Detail Enhancement for Adaptive Levels of Detail Gaussian Avatars

With the advancement of virtual reality, the demand for 3D human avatars is increasing. The emergence of Gaussian Splatting technology has enabled the rendering of Gaussian avatars with superior visual quality and reduced computational costs. Despite numerous methods researchers propose for implementing drivable Gaussian avatars, limited attention has been given to balancing visual quality and computational costs. In this paper, we introduce LoDAvatar, a method that introduces levels of detail into Gaussian avatars through hierarchical embedding and selective detail enhancement methods. The key steps of LoDAvatar encompass data preparation, Gaussian embedding, Gaussian optimization, and selective detail enhancement. We conducted experiments involving Gaussian avatars at various levels of detail, employing both objective assessments and subjective evaluations. The outcomes indicate that incorporating levels of detail into Gaussian avatars can decrease computational costs during rendering while upholding commendable visual quality, thereby enhancing runtime frame rates. We advocate adopting LoDAvatar to render multiple dynamic Gaussian avatars or extensive Gaussian scenes to balance visual quality and computational costs.

cs.GR↗

arXiv2025

DRAUN: An Algorithm-Agnostic Data Reconstruction Attack on Federated Unlearning Systems

Federated Unlearning (FU) enables clients to remove the influence of specific data from a collaboratively trained shared global model, addressing regulatory requirements such as GDPR and CCPA. However, this unlearning process introduces a new privacy risk: A malicious server may exploit unlearning updates to reconstruct the data requested for removal, a form of Data Reconstruction Attack (DRA). While DRAs for machine unlearning have been studied extensively in centralized Machine Learning-as-a-Service (MLaaS) settings, their applicability to FU remains unclear due to the decentralized, client-driven nature of FU. This work presents DRAUN, the first attack framework to reconstruct unlearned data in FU systems. DRAUN targets optimization-based unlearning methods, which are widely adopted for their efficiency. We theoretically demonstrate why existing DRAs targeting machine unlearning in MLaaS fail in FU and show how DRAUN overcomes these limitations. We validate our approach through extensive experiments on four datasets and four model architectures, evaluating its performance against five popular unlearning methods, effectively demonstrating that state-of-the-art FU methods remain vulnerable to DRAs.

cs.LG↗

arXiv2025

Learning Long Short-Term Intention within Human Daily Behaviors

In the domain of autonomous household robots, it is of utmost importance for robots to understand human behaviors and provide appropriate services. This requires the robots to possess the capability to analyze complex human behaviors and predict the true intentions of humans. Traditionally, humans are perceived as flawless, with their decisions acting as the standards that robots should strive to align with. However, this raises a pertinent question: What if humans make mistakes? In this research, we present a unique task, termed "long short-term intention prediction". This task requires robots can predict the long-term intention of humans, which aligns with human values, and the short term intention of humans, which reflects the immediate action intention. Meanwhile, the robots need to detect the potential non-consistency between the short-term and long-term intentions, and provide necessary warnings and suggestions. To facilitate this task, we propose a long short-term intention model to represent the complex intention states, and build a dataset to train this intention model. Then we propose a two-stage method to integrate the intention model for robots: i) predicting human intentions of both value-based long-term intentions and action-based short-term intentions; and 2) analyzing the consistency between the long-term and short-term intentions. Experimental results indicate that the proposed long short-term intention model can assist robots in comprehending human behavioral patterns over both long-term and short-term durations, which helps determine the consistency between long-term and short-term intentions of humans.

cs.RO↗

arXiv2025

Infant Cry Detection Using Causal Temporal Representation

This paper addresses a major challenge in acoustic event detection, in particular infant cry detection in the presence of other sounds and background noises: the lack of precise annotated data. We present two contributions for supervised and unsupervised infant cry detection. The first is an annotated dataset for cry segmentation, which enables supervised models to achieve state-of-the-art performance. Additionally, we propose a novel unsupervised method, Causal Representation Spare Transition Clustering (CRSTC), based on causal temporal representation, which helps address the issue of data scarcity more generally. By integrating the detected cry segments, we significantly improve the performance of downstream infant cry classification, highlighting the potential of this approach for infant care applications.

cs.SD↗

arXiv2024

High Order Finite Difference Schemes for the Transparent Boundary Conditions and Their Applications in the 1D Schrödinger-Poisson Problem

The 1D Schrödinger equation closed with the transparent boundary conditions(TBCs) is known as a successful model for describing quantum effects, and is usually considered with a self-consistent Poisson equation in simulating quantum devices. We introduce discrete fourth order transparent boundary conditions(D4TBCs), which have been proven to be essentially non-oscillating when the potential vanishes, and to share the same accuracy order with the finite difference scheme used to discretize the 1D Schrödinger equation. Furthermore, a framework of analytic discretization of TBCs(aDTBCs) is proposed, which does not introduce any discretization error, thus is accurate. With the accurate discretizations, one is able to improve the accuracy of the discretization for the 1D Schrödinger problem to arbitrarily high levels. As numerical tools, two globally fourth order compact finite difference schemes are proposed for the 1D Schrödinger-Poisson problem, involving either of the D4TBCs or the aDTBCs, respectively, and the uniqueness of solutions of both discrete Schrödinger problems are rigorously proved. Numerical experiments, including simulations of a resistor and two nanoscale resonant tunneling diodes, verify the accuracy order of the discretization schemes and show potential of the numerical algorithm introduced for the 1D Schrödinger-Poisson problem in simulating various quantum devices.

math.NA↗

arXiv2024

LightSword: A Customized Virtual Reality Exergame for Long-Term Cognitive Inhibition Training in Older Adults

The decline of cognitive inhibition significantly impacts older adults' quality of life and well-being, making it a vital public health problem in today's aging society. Previous research has demonstrated that Virtual reality (VR) exergames have great potential to enhance cognitive inhibition among older adults. However, existing commercial VR exergames were unsuitable for older adults' long-term cognitive training due to the inappropriate cognitive activation paradigm, unnecessary complexity, and unbefitting difficulty levels. To bridge these gaps, we developed a customized VR cognitive training exergame (LightSword) based on Dual-task and Stroop paradigms for long-term cognitive inhibition training among healthy older adults. Subsequently, we conducted an eight-month longitudinal user study with 12 older adults aged 60 years and above to demonstrate the effectiveness of LightSword in improving cognitive inhibition. After the training, the cognitive inhibition abilities of older adults were significantly enhanced, with benefits persisting for 6 months. This result indicated that LightSword has both short-term and long-term effects in enhancing cognitive inhibition. Furthermore, qualitative feedback revealed that older adults exhibited a positive attitude toward long-term training with LightSword, which enhanced their motivation and compliance.

cs.HC↗

arXiv2023

Joint User Association and Transmission Scheduling in Integrated mmWave Access and Terahertz Backhaul Networks

Terahertz wireless backhaul is expected to meet the high-speed backhaul requirements of future ultra-dense networks using millimeter-wave (mmWave) base stations (BSs). In order to achieve higher network capacity with limited resources and meet the quality of service (QoS) requirements of more users in the integrated mmWave access and terahertz backhaul network, this paper formulates a problem of maximizing the number of users successfully served in both the access and backhaul links. Since the problem is a non-linear integer optimization problem, a minimum rate ratio user association and transmission scheduling algorithm is proposed to obtain a suboptimal solution. The proposed algorithm takes the minimum rate ratio as the user association criterion and schedules first the users with fewer backhaul transmission slots. In addition, the algorithm will update the number of access transmission slots allocated to users and the access scheduling results after the backhaul scheduling phase. Numerical results show that the proposed algorithm outperforms several benchmark algorithms in terms of the number of served users and system throughput, and it can cope with a large number of bursty user requests.

cs.IT↗

arXiv2022

Feature Grouping and Sparse Principal Component Analysis with Truncated Regularization

In this paper, we consider a new variant for principal component analysis (PCA), aiming to capture the grouping and/or sparse structures of factor loadings simultaneously. To achieve these goals, we employ a non-convex truncated regularization with naturally adjustable sparsity and grouping effects, and propose the Feature Grouping and Sparse Principal Component Analysis (FGSPCA). The proposed FGSPCA method encourages the factor loadings with similar values to collapse into disjoint homogeneous groups for feature grouping or into a special zero-valued group for feature selection, which in turn helps reducing model complexity and increasing model interpretation. Usually, existing structured PCA methods require prior knowledge to construct the regularization term. However, the proposed FGSPCA can simultaneously capture the grouping and/or sparse structures of factor loadings without any prior information. To solve the resulting non-convex optimization problem, we propose an alternating algorithm that incorporates the difference-of-convex programming, augmented Lagrange method and coordinate descent method. Experimental results demonstrate the promising performance and efficiency of the new method on both synthetic and real-world datasets. An R implementation of FGSPCA can be found on github {https://github.com/higeeks/FGSPCA}.

stat.ME↗

arXiv2022

A higher-order accurate operator splitting spectral method for the Wigner-Poisson system

An accurate description of 2-D quantum transport in a double-gate metal oxide semiconductor filed effect transistor (dgMOSFET) requires a high-resolution solver to a coupled system of the 4-D Wigner equation and 2-D Poisson equation. In this paper, we propose an operator splitting spectral method to evolve such Wigner-Poisson system in 4-D phase space with high accuracy. After an operator splitting of the Wigner equation, the resulting two sub-equations can be solved analytically with spectral approximation in phase space. Meanwhile, we adopt a Chebyshev spectral method to solve the Poisson equation. Spectral convergence in phase space and a fourth-order accuracy in time are both numerically verified. Finally, we apply the proposed solver into simulating dgMOSFET, develop the steady states from long-time simulations and obtain numerically converged current-voltage (I-V) curves.

physics.comp-ph↗

arXiv2021

AgFlow: Fast Model Selection of Penalized PCA via Implicit Regularization Effects of Gradient Flow

Principal component analysis (PCA) has been widely used as an effective technique for feature extraction and dimension reduction. In the High Dimension Low Sample Size (HDLSS) setting, one may prefer modified principal components, with penalized loadings, and automated penalty selection by implementing model selection among these different models with varying penalties. The earlier work [1, 2] has proposed penalized PCA, indicating the feasibility of model selection in $L_2$- penalized PCA through the solution path of Ridge regression, however, it is extremely time-consuming because of the intensive calculation of matrix inverse. In this paper, we propose a fast model selection method for penalized PCA, named Approximated Gradient Flow (AgFlow), which lowers the computation complexity through incorporating the implicit regularization effect introduced by (stochastic) gradient flow [3, 4] and obtains the complete solution path of $L_2$-penalized PCA under varying $L_2$-regularization. We perform extensive experiments on real-world datasets. AgFlow outperforms existing methods (Oja [5], Power [6], and Shamir [7] and the vanilla Ridge estimators) in terms of computation costs.

cs.LG↗

arXiv2021

Robust Matrix Factorization with Grouping Effect

Although many techniques have been applied to matrix factorization (MF), they may not fully exploit the feature structure. In this paper, we incorporate the grouping effect into MF and propose a novel method called Robust Matrix Factorization with Grouping effect (GRMF). The grouping effect is a generalization of the sparsity effect, which conducts denoising by clustering similar values around multiple centers instead of just around 0. Compared with existing algorithms, the proposed GRMF can automatically learn the grouping structure and sparsity in MF without prior knowledge, by introducing a naturally adjustable non-convex regularization to achieve simultaneous sparsity and grouping effect. Specifically, GRMF uses an efficient alternating minimization framework to perform MF, in which the original non-convex problem is first converted into a convex problem through Difference-of-Convex (DC) programming, and then solved by Alternating Direction Method of Multipliers (ADMM). In addition, GRMF can be easily extended to the Non-negative Matrix Factorization (NMF) settings. Extensive experiments have been conducted using real-world data sets with outliers and contaminated noise, where the experimental results show that GRMF has promoted performance and robustness, compared to five benchmark algorithms.

cs.LG↗

arXiv2019

Coalition Game based Full-duplex Concurrent Scheduling in Millimeter Wave Wireless Backhaul Network

With the development of self-interference (SI) cancelation technology, full-duplex (FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot (TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game (FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm can achieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.

cs.NI↗

arXiv2018

Inverse Augmented Reality: A Virtual Agent's Perspective

We propose a framework called inverse augmented reality (IAR) which describes the scenario that a virtual agent living in the virtual world can observe both virtual objects and real objects. This is different from the traditional augmented reality. The traditional virtual reality, mixed reality and augmented reality are all generated for humans, i.e., they are human-centered frameworks. On the contrary, the proposed inverse augmented reality is a virtual agent-centered framework, which represents and analyzes the reality from a virtual agent's perspective. In this paper, we elaborate the framework of inverse augmented reality to argue the equivalence of the virtual world and the physical world regarding the whole physical structure.

cs.HC↗