arXiv subjects

Jingyuan Li

Publications and source records attributed to Jingyuan Li.

At least 55 records · Page 3Linked to original sources

arXiv2025

Quantifying Bounded Rationality: Formal Verification of Simon's Satisficing Through Flexible Stochastic Dominance

This paper introduces Flexible First-Order Stochastic Dominance (FFSD), a mathematically rigorous framework that formalizes Herbert Simon's concept of bounded rationality using the Lean 4 theorem prover. We develop machine-verified proofs demonstrating that FFSD bridges classical expected utility theory with Simon's satisficing behavior through parameterized tolerance thresholds. Our approach yields several key results: (1) a critical threshold $\varepsilon < 1/2$ that guarantees uniqueness of reference points, (2) an equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions, and (3) extensions to multi-dimensional decision settings. By encoding these concepts in Lean 4's dependent type theory, we provide the first machine-checked formalization of Simon's bounded rationality, creating a foundation for mechanized reasoning about economic decision-making under uncertainty with cognitive limitations. This work contributes to the growing intersection between formal mathematics and economic theory, demonstrating how interactive theorem proving can advance our understanding of behavioral economics concepts that have traditionally been expressed only qualitatively.

q-fin.MF↗

arXiv2025

Unveiling the multiband metallic nature of the normal state in nickelate La3Ni2O7

The discovery of unconventional superconductivity around 80 K in perovskite nickelates under high pressure has furnished a new platform to explore high-temperature unconventional superconductivity in addition to cuprates. Understanding the normal state of nickelate superconductors is crucial to uncovering the origin of this unconventional superconductivity and gaining further insight into its underlying mechanism. In this study, we systemically studied the transport properties of La3Ni2O7 by tuning the pressure under high magnetic fields. Magnetoresistance (MR) consistently exhibits a quasi-quadratic dependence on the magnetic field across all measured pressures and temperatures. Increased pressure enhances the metallicity of the system and leads to a monotonic increase in MR, which follows the extended Kohler's rule. These results suggest that the normal state of La3Ni2O7 to be a multiband metallic nature.

cond-mat.supr-con↗

arXiv2025

SAVVY: Spatial Awareness via Audio-Visual LLMs through Seeing and Hearing

3D spatial reasoning in dynamic, audio-visual environments is a cornerstone of human cognition yet remains largely unexplored by existing Audio-Visual Large Language Models (AV-LLMs) and benchmarks, which predominantly focus on static or 2D scenes. We introduce SAVVY-Bench, the first benchmark for 3D spatial reasoning in dynamic scenes with synchronized spatial audio. SAVVY-Bench is comprised of thousands of relationships involving static and moving objects, and requires fine-grained temporal grounding, consistent 3D localization, and multi-modal annotation. To tackle this challenge, we propose SAVVY, a novel training-free reasoning pipeline that consists of two stages: (i) Egocentric Spatial Tracks Estimation, which leverages AV-LLMs as well as other audio-visual methods to track the trajectories of key objects related to the query using both visual and spatial audio cues, and (ii) Dynamic Global Map Construction, which aggregates multi-modal queried object trajectories and converts them into a unified global dynamic map. Using the constructed map, a final QA answer is obtained through a coordinate transformation that aligns the global map with the queried viewpoint. Empirical evaluation demonstrates that SAVVY substantially enhances performance of state-of-the-art AV-LLMs, setting a new standard and stage for approaching dynamic 3D spatial reasoning in AV-LLMs.

cs.CV↗

arXiv2025

Geometric Formalization of First-Order Stochastic Dominance in $N$ Dimensions: A Tractable Path to Multi-Dimensional Economic Decision Analysis

This paper introduces and formally verifies a novel geometric framework for first-order stochastic dominance (FSD) in $N$ dimensions using the Lean 4 theorem prover. Traditional analytical approaches to multi-dimensional stochastic dominance rely heavily on complex measure theory and multivariate calculus, creating significant barriers to formalization in proof assistants. Our geometric approach characterizes $N$-dimensional FSD through direct comparison of survival probabilities in upper-right orthants, bypassing the need for complex integration theory. We formalize key definitions and prove the equivalence between traditional FSD requirements and our geometric characterization. This approach achieves a more tractable and intuitive path to formal verification while maintaining mathematical rigor. We demonstrate how this framework directly enables formal analysis of multi-dimensional economic problems in portfolio selection, risk management, and welfare analysis. The work establishes a foundation for further development of verified decision-making tools in economics and finance, particularly for high-stakes domains requiring rigorous guarantees.

cs.LO↗

arXiv2025

Identification of the superconductivity in bilayer nickelate La$_3$Ni$_2$O$_7$ upon 100 GPa

Identification of superconductivity in the Ruddlesden-Popper phases of nickelates under high pressure remains challenging. Here, we report a comprehensive study of the crystal structure, resistance, and Meissner effect in single crystals of La$_3$Ni$_2$O$_7$ with hydrostatic pressures up to 104 GPa. X-ray diffraction measurements reveal a structural transition from the orthorhombic to a tetragonal phase above 40 GPa. Zero resistance of the superconductivity was achieved with a maximum onset $T_c^{onset}$ of 83 K at 18.0 GPa. Superconductivity is gradually suppressed until it disappears above 80 GPa, resulting in a right-triangle-like superconducting region. The direct-current magnetic susceptibility technique successfully detected the Meissner effect in La$_3$Ni$_2$O$_7$ under pressure; the maximum superconducting volume fraction is estimated to be 62.7% at 22.0 GPa. Thus, we demonstrate the bulk nature of superconductivity in the bilayer nickelate La$_3$Ni$_2$O$_7$ single crystals under high pressure. The results reveal intimate connections among the superconductivity, oxygen content, and structure in La$_3$Ni$_2$O$_7$.

cond-mat.supr-con↗

arXiv2025

COMET:Combined Matrix for Elucidating Targets

Identifying the interaction targets of bioactive compounds is a foundational element for deciphering their pharmacological effects. Target prediction algorithms equip researchers with an effective tool to rapidly scope and explore potential targets. Here, we introduce the COMET, a multi-technological modular target prediction tool that provides comprehensive predictive insights, including similar active compounds, three-dimensional predicted binding modes, and probability scores, all within an average processing time of less than 10 minutes per task. With meticulously curated data, the COMET database encompasses 990,944 drug-target interaction pairs and 45,035 binding pockets, enabling predictions for 2,685 targets, which span confirmed and exploratory therapeutic targets for human diseases. In comparative testing using datasets from ChEMBL and BindingDB, COMET outperformed five other well-known algorithms, offering nearly an 80% probability of accurately identifying at least one true target within the top 15 predictions for a given compound. COMET also features a user-friendly web server, accessible freely at https://www.pdbbind-plus.org.cn/comet.

cs.LG↗

arXiv2025

Solving McKean-Vlasov Equation by deep learning particle method

We introduce a novel meshless simulation method for the McKean-Vlasov Stochastic Differential Equation (MV-SDE) utilizing deep learning, applicable to both self-interaction and interaction scenarios. Traditionally, numerical methods for this equation rely on the interacting particle method combined with techniques based on the Itô-Taylor expansion. The convergence rate of this approach is determined by two parameters: the number of particles $N$ and the time step size $h$ for each Euler iteration. However, for extended time horizons or equations with larger Lipschitz coefficients, this method is often limited, as it requires a significant increase in Euler iterations to achieve the desired precision $ε$. To overcome the challenges posed by the difficulty of parallelizing the simulation of continuous interacting particle systems, which involve solving high-dimensional coupled SDEs, we propose a meshless MV-SDE solver grounded in Physics-Informed Neural Networks (PINNs) that does not rely on the propagation of chaos result. Our method constructs a pseudo MV-SDE using Itô calculus, then quantifies the discrepancy between this equation and the original MV-SDE, with the error minimized through a loss function. This loss is controlled via an optimization algorithm, independent of the time step size, and we provide an error estimate for the loss function. The advantages of our approach are demonstrated through corresponding simulations.

math.NA↗

arXiv2024

Brain-to-Text Benchmark '24: Lessons Learned

Speech brain-computer interfaces aim to decipher what a person is trying to say from neural activity alone, restoring communication to people with paralysis who have lost the ability to speak intelligibly. The Brain-to-Text Benchmark '24 and associated competition was created to foster the advancement of decoding algorithms that convert neural activity to text. Here, we summarize the lessons learned from the competition ending on June 1, 2024 (the top 4 entrants also presented their experiences in a recorded webinar). The largest improvements in accuracy were achieved using an ensembling approach, where the output of multiple independent decoders was merged using a fine-tuned large language model (an approach used by all 3 top entrants). Performance gains were also found by improving how the baseline recurrent neural network (RNN) model was trained, including by optimizing learning rate scheduling and by using a diphone training objective. Improving upon the model architecture itself proved more difficult, however, with attempts to use deep state space models or transformers not yet appearing to offer a benefit over the RNN baseline. The benchmark will remain open indefinitely to support further work towards increasing the accuracy of brain-to-text algorithms.

cs.CL↗

arXiv2024

Brain-to-Text Decoding with Context-Aware Neural Representations and Large Language Models

Decoding attempted speech from neural activity offers a promising avenue for restoring communication abilities in individuals with speech impairments. Previous studies have focused on mapping neural activity to text using phonemes as the intermediate target. While successful, decoding neural activity directly to phonemes ignores the context dependent nature of the neural activity-to-phoneme mapping in the brain, leading to suboptimal decoding performance. In this work, we propose the use of diphone - an acoustic representation that captures the transitions between two phonemes - as the context-aware modeling target. We integrate diphones into existing phoneme decoding frameworks through a novel divide-and-conquer strategy in which we model the phoneme distribution by marginalizing over the diphone distribution. Our approach effectively leverages the enhanced context-aware representation of diphones while preserving the manageable class size of phonemes, a key factor in simplifying the subsequent phoneme-to-text conversion task. We demonstrate the effectiveness of our approach on the Brain-to-Text 2024 benchmark, where it achieves state-of-the-art Phoneme Error Rate (PER) of 15.34% compared to 16.62% PER of monophone-based decoding. When coupled with finetuned Large Language Models (LLMs), our method yields a Word Error Rate (WER) of 5.77%, significantly outperforming the 8.93% WER of the leading method in the benchmark.

eess.SP↗

arXiv2024

Signature of Superconductivity in Pressurized Trilayer-nickelate Pr$_4$Ni$_3$O$_{10-δ}$

The discovery of high-temperature superconductivity in La$_3$Ni$_2$O$_7$ and La$_4$Ni$_3$O$_{10}$ under pressure has drawn extensive attention. Herein, we report systematic investigations on the evolutions of structure, magnetism, and electrical resistance of Pr$_4$Ni$_3$O$_{10-δ}$ polycrystalline samples under various pressures. Pr$_4$Ni$_3$O$_{10-δ}$ exhibits density wave transitions on Ni and Pr sublattices at about 158 K and 4.3 K, respectively, and the density wave can be progressively suppressed by pressure. A structural transformation from the monoclinic $P2_1/a$ space group to the tetragonal $I4/mmm$ occurs at around 20 GPa. An apparent drop in resistance with evident magnetic field dependence is observed as pressure above 20 GPa, indicating the emergence of superconductivity in Pr$_4$Ni$_3$O$_{10-δ}$ polycrystalline samples. The discovery of the signature of superconductivity in Pr$_4$Ni$_3$O$_{10-δ}$ broadens the family of nickelate superconductors and provides a new platform for investigating the mechanisms of superconductivity in the Ruddlesden-Popper phases of nickelates.

cond-mat.supr-con↗

arXiv2024

Translating Mental Imaginations into Characters with Codebooks and Dynamics-Enhanced Decoding

Advancements in non-invasive electroencephalogram (EEG)-based Brain-Computer Interface (BCI) technology have enabled communication through brain activity, offering significant potential for individuals with motor impairments. Existing methods for decoding characters or words from EEG recordings either rely on continuous external stimulation for high decoding accuracy or depend on direct intention imagination, which suffers from reduced discrimination ability. To overcome these limitations, we introduce a novel EEG paradigm based on mental tasks that achieves high discrimination accuracy without external stimulation. Specifically, we propose a codebook in which each letter or number is associated with a unique code that integrates three mental tasks, interleaved with eye-open and eye-closed states. This approach allows individuals to internally reference characters without external stimuli while maintaining reasonable accuracy. For enhanced decoding performance, we apply a Temporal-Spatial-Latent-Dynamics (TSLD) network to capture latent dynamics of spatiotemporal EEG signals. Experimental results demonstrate the effectiveness of our proposed EEG paradigm which achieves five times higher accuracy over direct imagination. Additionally, the TSLD network improves baseline methods by approximately 8.5%. Further more, we observe consistent performance improvement throughout the data collection process, suggesting that the proposed paradigm has potential for further optimization with continued use.

eess.SP↗

arXiv2024

ReLExS: Reinforcement Learning Explanations for Stackelberg No-Regret Learners

With the constraint of a no regret follower, will the players in a two-player Stackelberg game still reach Stackelberg equilibrium? We first show when the follower strategy is either reward-average or transform-reward-average, the two players can always get the Stackelberg Equilibrium. Then, we extend that the players can achieve the Stackelberg equilibrium in the two-player game under the no regret constraint. Also, we show a strict upper bound of the follower's utility difference between with and without no regret constraint. Moreover, in constant-sum two-player Stackelberg games with non-regret action sequences, we ensure the total optimal utility of the game remains also bounded.

cs.GT↗

arXiv2024

GLIMMER: Incorporating Graph and Lexical Features in Unsupervised Multi-Document Summarization

Pre-trained language models are increasingly being used in multi-document summarization tasks. However, these models need large-scale corpora for pre-training and are domain-dependent. Other non-neural unsupervised summarization approaches mostly rely on key sentence extraction, which can lead to information loss. To address these challenges, we propose a lightweight yet effective unsupervised approach called GLIMMER: a Graph and LexIcal features based unsupervised Multi-docuMEnt summaRization approach. It first constructs a sentence graph from the source documents, then automatically identifies semantic clusters by mining low-level features from raw texts, thereby improving intra-cluster correlation and the fluency of generated sentences. Finally, it summarizes clusters into natural sentences. Experiments conducted on Multi-News, Multi-XScience and DUC-2004 demonstrate that our approach outperforms existing unsupervised approaches. Furthermore, it surpasses state-of-the-art pre-trained multi-document summarization models (e.g. PEGASUS and PRIMERA) under zero-shot settings in terms of ROUGE scores. Additionally, human evaluations indicate that summaries generated by GLIMMER achieve high readability and informativeness scores. Our code is available at https://github.com/Oswald1997/GLIMMER.

cs.CL↗

arXiv2024

Feynman-Kac Operator Expectation Estimator

The Feynman-Kac Operator Expectation Estimator (FKEE) is an innovative method for estimating the target Mathematical Expectation $\mathbb{E}_{X\sim P}[f(X)]$ without relying on a large number of samples, in contrast to the commonly used Markov Chain Monte Carlo (MCMC) Expectation Estimator. FKEE comprises diffusion bridge models and approximation of the Feynman-Kac operator. The key idea is to use the solution to the Feynmann-Kac equation at the initial time $u(x_0,0)=\mathbb{E}[f(X_T)|X_0=x_0]$. We use Physically Informed Neural Networks (PINN) to approximate the Feynman-Kac operator, which enables the incorporation of diffusion bridge models into the expectation estimator and significantly improves the efficiency of using data while substantially reducing the variance. Diffusion Bridge Model is a more general MCMC method. In order to incorporate extensive MCMC algorithms, we propose a new diffusion bridge model based on the Minimum Wasserstein distance. This diffusion bridge model is universal and reduces the training time of the PINN. FKEE also reduces the adverse impact of the curse of dimensionality and weakens the assumptions on the distribution of $X$ and performance function $f$ in the general MCMC expectation estimator. The theoretical properties of this universal diffusion bridge model are also shown. Finally, we demonstrate the advantages and potential applications of this method through various concrete experiments, including the challenging task of approximating the partition function in the random graph model such as the Ising model.

stat.ML↗

arXiv2024

Co-designing a Sub-millisecond Latency Event-based Eye Tracking System with Submanifold Sparse CNN

Eye-tracking technology is integral to numerous consumer electronics applications, particularly in the realm of virtual and augmented reality (VR/AR). These applications demand solutions that excel in three crucial aspects: low-latency, low-power consumption, and precision. Yet, achieving optimal performance across all these fronts presents a formidable challenge, necessitating a balance between sophisticated algorithms and efficient backend hardware implementations. In this study, we tackle this challenge through a synergistic software/hardware co-design of the system with an event camera. Leveraging the inherent sparsity of event-based input data, we integrate a novel sparse FPGA dataflow accelerator customized for submanifold sparse convolution neural networks (SCNN). The SCNN implemented on the accelerator can efficiently extract the embedding feature vector from each representation of event slices by only processing the non-zero activations. Subsequently, these vectors undergo further processing by a gated recurrent unit (GRU) and a fully connected layer on the host CPU to generate the eye centers. Deployment and evaluation of our system reveal outstanding performance metrics. On the Event-based Eye-Tracking-AIS2024 dataset, our system achieves 81% p5 accuracy, 99.5% p10 accuracy, and 3.71 Mean Euclidean Distance with 0.7 ms latency while only consuming 2.29 mJ per inference. Notably, our solution opens up opportunities for future eye-tracking systems. Code is available at https://github.com/CASR-HKU/ESDA/tree/eye_tracking.

cs.CV↗

arXiv2024

Event-Based Eye Tracking. AIS 2024 Challenge Survey

This survey reviews the AIS 2024 Event-Based Eye Tracking (EET) Challenge. The task of the challenge focuses on processing eye movement recorded with event cameras and predicting the pupil center of the eye. The challenge emphasizes efficient eye tracking with event cameras to achieve good task accuracy and efficiency trade-off. During the challenge period, 38 participants registered for the Kaggle competition, and 8 teams submitted a challenge factsheet. The novel and diverse methods from the submitted factsheets are reviewed and analyzed in this survey to advance future event-based eye tracking research.

cs.CV↗

arXiv2024

Structural transition, electric transport, and electronic structures in the compressed trilayer nickelate La4Ni3O10

Atomic structure and electronic band structure are fundamental properties for understanding the mechanism of superconductivity. Motivated by the discovery of pressure-induced high-temperature superconductivity at 80 K in the bilayer Ruddlesden-Popper nickelate La3Ni2O7, the atomic structure and electronic band structure of the trilayer nickelate La4Ni3O10 under pressure up to 44.3 GPa are investigated. A structural transition from the monoclinic P21/a space group to the tetragonal I4/mmm around 12.6-13.4 GPa is identified, accompanying with a drop of resistance below 7 K. Density functional theory calculations suggest that the bonding state of Ni 3dz2 orbital rises and crosses the Fermi level at high pressures, which may give rise to possible superconductivity observed in resistance under pressure in La4Ni3O10. The trilayer nickelate La4Ni3O10 shows some similarities with the bilayer La3Ni2O7 and has unique properties, providing a new platform to investigate the underlying mechanism of superconductivity in nickelates.

cond-mat.supr-con↗

arXiv2024

Link Node: A Method to Characterize the Chain Topology of Intrinsically Disordered Proteins

It is well-known that intrinsically disordered proteins (IDP) are highly dynamic, which is related to their functionality in various biological processes. However, the characterization of the intricate structures of IDP has been a challenge. Here, we analyze the chain topology of IDPs to characterize their conformations, in combination with molecular dynamics simulation (MD). We systematically compute the Gauss Linking Number ($GLN$) between segments in IDP, and show that the resulting GLN Map can effectively depict an unconventional structure -- physical link, i.e., the entanglement between two segments. The crossing points of physical links are further identified and denoted as Link Nodes. We show that the probability distribution of Link Nodes is highly heterogeneous and there are certain residues that largely affect the chain topology of IDP. Moreover, the structural fluctuations of the vicinity of these residues are largely suppressed, i.e., Link Node provides useful information about the topological constraint imposed on the residues during the conformation fluctuations of IDP. We further reveal that the evolution of the chain topology is considerably slow (with a timescale of hundreds of nanoseconds), which is distinct from the flipping of residue contact.

physics.bio-ph↗