arXiv subjects

Jingjing Hu

Publications and source records attributed to Jingjing Hu.

15 recordsLinked to original sources

arXiv2026

See the Emotion: A Facial Emoji Proxy Modeling for EEG Emotion Recognition

Despite the high accuracy of EEG-based emotion recognition, existing models remain opaque "black boxes", lacking semantic grounding between abstract neural features and human-interpretable states. In this paper, we reframe EEG explainability as a cross-modal generation task, shifting the paradigm from feature attribution to behavioral visualization. We introduce Facial Emoji Proxy Modeling, a novel framework that translates high-dimensional EEG signals into identity-anonymized facial emojis. Guided by the neuroscientific inspiration of neural-facial association, this approach grounds neural representations in the manifold of observable facial dynamics. Technically, our framework integrates FMENet, a specialized backbone modeling expression-relevant spatial synergies, and the Facial Emoji Learning Branch (FELB), which treats emoji reconstruction as a structured semantic regularizer. Extensive experiments on EAV and MMER benchmarks demonstrate that our method achieves state-of-the-art accuracy among EEG-only models. Crucially, it generates semantically faithful facial animations that provide a transparent, privacy-preserving window into the brain's emotional evolution, effectively allowing users to "see the emotion" directly from neural signals. Code is available at https://github.com/xian-sh/SeeEmotion

cs.CV↗

arXiv2026

A Granularity-Aware EEG Feature Framework for Psychopathology Dimension Prediction

Electroencephalography (EEG) offers a noninvasive approach for examining neurophysiological correlates of dimensional psychopathology, yet systematic evidence across EEG paradigms and feature granularities remains limited. Here, we develop a granularity-aware EEG feature pipeline that organizes multi-scale descriptors into global, regional, and channel levels. Using the Healthy Brain Network (HBN) cohort, we evaluate the prediction of four psychopathology dimensions: p-factor, internalizing, externalizing, and attention problems, across four EEG paradigms. Given the heterogeneity of pediatric psychopathology and the moderate reliability of questionnaire-derived scores, this setting represents a challenging feasibility test rather than a clinical screening scenario. Tree-based models and granularity-balanced feature selection showed promising improvements over conventional approaches in selected conditions, although effect sizes remained modest. Visualization of selected markers revealed dimension-specific spatial and spectral patterns that were broadly aligned with existing neurophysiological knowledge. An exploratory cross-dataset sanity check on the independent PEARL cohort suggested that the proposed selection principle remains technically feasible under protocol shifts, without claiming cross-dataset generalizability. Overall, multi-scale EEG features contain weak but detectable signals related to dimensional psychopathology, and granularity-aware selection may serve as a useful feature-reduction strategy for future EEG-based phenotyping studies.

cs.LG↗

arXiv2026

Face-Guided Sentiment Boundary Enhancement for Weakly-Supervised Temporal Sentiment Localization

Point-level weakly-supervised temporal sentiment localization (P-WTSL) aims to detect sentiment-relevant segments in untrimmed multimodal videos using timestamp sentiment annotations, which greatly reduces the costly frame-level labeling. To further tackle the challenges of imprecise sentiment boundaries in P-WTSL, we propose the Face-guided Sentiment Boundary Enhancement Network (\textbf{FSENet}), a unified framework that leverages fine-grained facial features to guide sentiment localization. Specifically, our approach \textit{first} introduces the Face-guided Sentiment Discovery (FSD) module, which integrates facial features into multimodal interaction via dual-branch modeling for effective sentiment stimuli clues; We \textit{then} propose the Point-aware Sentiment Semantics Contrast (PSSC) strategy to discriminate sentiment semantics of candidate points (frame-level) near annotation points via contrastive learning, thereby enhancing the model's ability to recognize sentiment boundaries. At \textit{last}, we design the Boundary-aware Sentiment Pseudo-label Generation (BSPG) approach to convert sparse point annotations into temporally smooth supervisory pseudo-labels. Extensive experiments and visualizations on the benchmark demonstrate the effectiveness of our framework, achieving state-of-the-art performance under full supervision, video-level, and point-level weak supervision, thereby showcasing the strong generalization ability of our FSENet across different annotation settings.

cs.CV↗

arXiv2025

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity

With the advancement of modern applications, an increasing number of composite optimization problems arise whose smooth component does not possess a globally Lipschitz continuous gradient. This setting prevents the direct use of the proximal gradient (PG) method and its variants, and has motivated a growing body of research on new PG-type methods and their convergence theory, in particular, global convergence analysis without imposing any explicit or implicit boundedness assumptions on the iterates. Until recently, the first complete analysis of this kind has been established for the PG method and its specific nonmonotone variants, which has since stimulated further exploration along this research direction. In this paper, we consider a general composite optimization model beyond the global Lipschitz gradient continuity setting. We propose a novel problem-parameter-free algorithm that incorporates a carefully designed nonmonotone line search to handle the non-global Lipschitz gradient continuity, together with an extrapolation step to achieve potential acceleration. Despite the added technical challenges introduced by combining extrapolation with nonmonotone line search, we establish a refined convergence analysis for the proposed algorithm under the Kurdyka-{\L} ojasiewicz property, without requiring any boundedness assumptions on the iterates. This work thus further advances the theoretical understanding of PG-type methods in the non-global Lipschitz gradient continuity setting. Finally, we conduct numerical experiments to illustrate the effectiveness of our algorithm and highlight the advantages of integrating extrapolation with a nonmonotone line search.

math.OC↗

arXiv2025

PANCAKE: Python bAsed Numerical Color-magnitude-diagram Analysis pacKagE

Stellar populations serve as a fossil record of galaxy formation and evolution, providing crucial information about the history of star formation and galaxy evolution. The color-magnitude diagram (CMD) stands out as the most accurate tool currently available for inferring the star formation histories (SFHs) of nearby galaxies with stellar-resolved multiband data. The launch of new space telescopes, including JWST, EUCLID, and the upcoming CSST and Roman, will significantly increase the number of stellar-resolved galaxies over the next decade. A user-friendly and customizable CMD fitting package would be valuable for galaxy evolution studies with these data. We develop an open-source Python-based package named \textsc{pancake}, which is fast and accurate in determining SFHs and stellar population parameters in nearby galaxies. We have validated our method via a series of comprehensive tests. First, \textsc{pancake} performs well on mock data, meanwhile the random and systematic uncertainties are quantified. Second, \textsc{pancake} performs well on observational data containing a star cluster and 38 dwarf galaxies (50 fields). Third, the star formation rate (SFR) from \textsc{pancake} is consistent with the SFR from FUV photometry. To ensure compatibility and accuracy, we have included isochrone libraries generated using PARSEC for most of the optical and near-infrared filters used in space telescopes such as HST, JWST, and the upcoming CSST.

astro-ph.GA↗

arXiv2025

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria

In this paper, we consider a class of difference-of-convex (DC) optimization problems, which require only a weaker restricted $L$-smooth adaptable property on the smooth part of the objective function, instead of the standard global Lipschitz gradient continuity assumption. Such problems are prevalent in many contemporary applications such as compressed sensing, statistical regression, and machine learning, and can be solved by a general Bregman proximal DC algorithm (BPDCA). However, the existing BPDCA is developed based on the stringent requirement that the involved subproblems must be solved exactly, which is often impractical and limits the applicability of the BPDCA. To facilitate the practical implementations and wider applications of the BPDCA, we develop an inexact Bregman proximal difference-of-convex algorithm (iBPDCA) by incorporating two types of relative-type stopping criteria for solving the subproblems. The proposed inexact framework has considerable flexibility to encompass many existing exact and inexact methods, and can accommodate different types of errors that may occur when solving the subproblem. This enables the potential application of our inexact framework across different DC decompositions to facilitate the design of a more efficient DCA scheme in practice. The global subsequential convergence and the global sequential convergence of our iBPDCA are established under suitable conditions including the Kurdyka-Łojasiewicz property. Some numerical experiments are conducted to show the superior performance of our iBPDCA in comparison to existing algorithms. These results also empirically validate the necessity and significance of developing different types of stopping criteria to facilitate the efficient computation of the subproblem in each iteration of our iBPDCA.

math.OC↗

arXiv2025

Unified Static and Dynamic Network: Efficient Temporal Filtering for Video Grounding

Inspired by the activity-silent and persistent activity mechanisms in human visual perception biology, we design a Unified Static and Dynamic Network (UniSDNet), to learn the semantic association between the video and text/audio queries in a cross-modal environment for efficient video grounding. For static modeling, we devise a novel residual structure (ResMLP) to boost the global comprehensive interaction between the video segments and queries, achieving more effective semantic enhancement/supplement. For dynamic modeling, we effectively exploit three characteristics of the persistent activity mechanism in our network design for a better video context comprehension. Specifically, we construct a diffusely connected video clip graph on the basis of 2D sparse temporal masking to reflect the "short-term effect" relationship. We innovatively consider the temporal distance and relevance as the joint "auxiliary evidence clues" and design a multi-kernel Temporal Gaussian Filter to expand the context clue into high-dimensional space, simulating the "complex visual perception", and then conduct element level filtering convolution operations on neighbour clip nodes in message passing stage for finally generating and ranking the candidate proposals. Our UniSDNet is applicable to both Natural Language Video Grounding (NLVG) and Spoken Language Video Grounding (SLVG) tasks. Our UniSDNet achieves SOTA performance on three widely used datasets for NLVG, as well as three datasets for SLVG, e.g., reporting new records at 38.88% R@1,IoU@0.7 on ActivityNet Captions and 40.26% R@1,IoU@0.5 on TACoS. To facilitate this field, we collect two new datasets (Charades-STA Speech and TACoS Speech) for SLVG task. Meanwhile, the inference speed of our UniSDNet is 1.56$\times$ faster than the strong multi-query benchmark. Code is available at: https://github.com/xian-sh/UniSDNet.

cs.CV↗

arXiv2025

Towards Open-Vocabulary Audio-Visual Event Localization

The Audio-Visual Event Localization (AVEL) task aims to temporally locate and classify video events that are both audible and visible. Most research in this field assumes a closed-set setting, which restricts these models' ability to handle test data containing event categories absent (unseen) during training. Recently, a few studies have explored AVEL in an open-set setting, enabling the recognition of unseen events as ``unknown'', but without providing category-specific semantics. In this paper, we advance the field by introducing the Open-Vocabulary Audio-Visual Event Localization (OV-AVEL) problem, which requires localizing audio-visual events and predicting explicit categories for both seen and unseen data at inference. To address this new task, we propose the OV-AVEBench dataset, comprising 24,800 videos across 67 real-life audio-visual scenes (seen:unseen = 46:21), each with manual segment-level annotation. We also establish three evaluation metrics for this task. Moreover, we investigate two baseline approaches, one training-free and one using a further fine-tuning paradigm. Specifically, we utilize the unified multimodal space from the pretrained ImageBind model to extract audio, visual, and textual (event classes) features. The training-free baseline then determines predictions by comparing the consistency of audio-text and visual-text feature similarities. The fine-tuning baseline incorporates lightweight temporal layers to encode temporal relations within the audio and visual modalities, using OV-AVEBench training data for model fine-tuning. We evaluate these baselines on the proposed OV-AVEBench dataset and discuss potential directions for future work in this new field.

cs.CV↗

arXiv2025

MOL-Mamba: Enhancing Molecular Representation with Structural & Electronic Insights

Molecular representation learning plays a crucial role in various downstream tasks, such as molecular property prediction and drug design. To accurately represent molecules, Graph Neural Networks (GNNs) and Graph Transformers (GTs) have shown potential in the realm of self-supervised pretraining. However, existing approaches often overlook the relationship between molecular structure and electronic information, as well as the internal semantic reasoning within molecules. This omission of fundamental chemical knowledge in graph semantics leads to incomplete molecular representations, missing the integration of structural and electronic data. To address these issues, we introduce MOL-Mamba, a framework that enhances molecular representation by combining structural and electronic insights. MOL-Mamba consists of an Atom & Fragment Mamba-Graph (MG) for hierarchical structural reasoning and a Mamba-Transformer (MT) fuser for integrating molecular structure and electronic correlation learning. Additionally, we propose a Structural Distribution Collaborative Training and E-semantic Fusion Training framework to further enhance molecular representation learning. Extensive experiments demonstrate that MOL-Mamba outperforms state-of-the-art baselines across eleven chemical-biological molecular datasets.

cs.LG↗

arXiv2024

Engineering the Environment of a Superconducting Qubit with an Artificial Giant Atom

In quantum computing, precise control of system-environment coupling is essential for high-fidelity gates, measurements, and networking. We present an architecture that employs an artificial giant atom from waveguide quantum electrodynamics to tailor the interaction between a superconducting qubit and its environment. This frequency-tunable giant atom exhibits both frequency and power selectivity for photons: when resonant with the qubit, it reflects single photons emitted from the qubit while remaining transparent to strong microwave signals for readout and control. This approach surpasses the Purcell limit and significantly extends the qubit's lifetime by ten times while maintaining the readout speed, thereby improving both gate operations and readout. Our architecture holds promise for bridging circuit and waveguide quantum electrodynamics systems in quantum technology applications.

quant-ph↗

arXiv2024

RTF: Region-based Table Filling Method for Relational Triple Extraction

Relational triple extraction is crucial work for the automatic construction of knowledge graphs. Existing methods only construct shallow representations from a token or token pair-level. However, previous works ignore local spatial dependencies of relational triples, resulting in a weakness of entity pair boundary detection. To tackle this problem, we propose a novel Region-based Table Filling method (RTF). We devise a novel region-based tagging scheme and bi-directional decoding strategy, which regard each relational triple as a region on the relation-specific table, and identifies triples by determining two endpoints of each region. We also introduce convolution to construct region-level table representations from a spatial perspective which makes triples easier to be captured. In addition, we share partial tagging scores among different relations to improve learning efficiency of relation classifier. Experimental results show that our method achieves state-of-the-art with better generalization capability on three variants of two widely used benchmark datasets.

cs.CL↗

arXiv2024

Minimizing Kinetic Inductance in Tantalum-Based Superconducting Coplanar Waveguide Resonators for Alleviating Frequency Fluctuation Issues

Advancements in the fabrication of superconducting quantum devices have highlighted tantalum as a promising material, owing to its low surface oxidation microwave loss at low temperatures. However, tantalum films exhibit significantly larger kinetic inductances compared to materials such as aluminum or niobium. Given the inevitable variations in film thickness, this increased kinetic inductance leads to considerable, uncontrolled frequency variances and shifts in components like superconducting coplanar waveguide (SCPW) resonators. Achieving high precision in resonator frequencies is crucial, particularly when multiple resonators share a common Purcell filter with limited bandwidth in superconducting quantum information processors. Here, we tackle this challenge from both fabrication and design perspectives, achieving a reduction in resonator frequency fluctuation by a factor of more than 100. Concurrently, the internal quality factor of the SCPW resonator remains at high level. Our findings open up new avenues for the enhanced utilization of tantalum in large-scale superconducting chips.

quant-ph↗

arXiv2024

Tantalum airbridges for scalable superconducting quantum processors

The unique property of tantalum (Ta), particularly its long coherent lifetime in superconducting qubits and its exceptional resistance to both acid and alkali, makes it promising for superconducting quantum processors. It is a notable advantage to achieve high-performance quantum processors with neat and unified fabrication of all circuit elements, including coplanar waveguides (CPW), qubits, and airbridges, on the tantalum film-based platform. Here, we propose a reliable tantalum airbridges with separate or fully-capped structure fabricated via a novel lift-off method, where a barrier layer with aluminium (Al) film is first introduced to separate two layers of photoresist and then etched away before the deposition of tantalum film, followed by cleaning with piranha solution to remove the residual photoresist on the chip. We characterize such tantalum airbridges as the control line jumpers, the ground plane crossovers and even coupling elements. They exhibit excellent connectivity, minimal capacitive loss, effectively suppress microwave and flux crosstalk and offer high freedom of coupling. Besides, by presenting a surface-13 tunable coupling superconducting quantum processor with median $T_1$ reaching above 100 $μ$s, the overall adaptability of tantalum airbridges is verified. The median single-qubit gate fidelity shows a tiny decrease from about 99.95% for the isolated Randomized Benchmarking to 99.94% for the simultaneous one. This fabrication method, compatible with all known superconducting materials, requires mild conditions of film deposition compared with the commonly used etching and grayscale lithography. Meanwhile, the experimental achievement of non-local coupling with controlled-Z (CZ) gate fidelity exceeding 99.2% may further facilitate qLDPC codes, laying a foundation for scalable quantum computation and quantum error correction with entirely tantalum elements.

quant-ph↗

arXiv2023

Optimizing Resonator Frequency Stability in Flip-Chip Architectures: A Novel Experimental Design Approach

In multi-qubit superconducting systems utilizing flip-chip technology, achieving high accuracy in resonator frequencies is of paramount importance, particularly when multiple resonators share a common Purcell filter with restricted bandwidth. Nevertheless, variations in inter-chip spacing can considerably influence these frequencies. To tackle this issue, we present and experimentally validate the effectiveness of a resonator design. In our design, we etch portions of the metal on the bottom chip that faces the resonator structure on the top chip. This enhanced design substantially improves frequency stability by a factor of over 3.5 compared to the non-optimized design, as evaluated by the root mean square error of a linear fitting of the observed frequency distribution, which is intended to be linear. This advancement is crucial for successful scale-up and achievement of high-fidelity quantum operations.

quant-ph↗

arXiv2023

Blinkverse: A Database of Fast Radio Bursts

The volume of research on fast radio bursts (FRBs) observation have been seeing a dramatic growth. To facilitate the systematic analysis of the FRB population, we established a database platform, Blinkverse (https://blinkverse.alkaidos.cn), as a central inventory of FRBs from various observatories and with published properties, particularly dynamic spectra from FAST, CHIME, GBT, Arecibo, etc. Blinkverse thus not only forms a superset of FRBCAT, TNS, and CHIME/FRB, but also provides convenient access to thousands of FRB dynamic spectra from FAST, some of which were not available before. Blinkverse is regularly maintained and will be updated by external users in the future. Data entries of FRBs can be retrieved through parameter searches through FRB location, fluence, etc., and their logical combinations. Interactive visualization was built into the platform. We analyzed the energy distribution, period analysis, and classification of FRBs based on data downloaded from Blinkverse. The energy distributions of repeaters and non-repeaters are found to be distinct from one another.

astro-ph.HE↗