arXiv subjects

Yu Feng

Publications and source records attributed to Yu Feng.

At least 73 records · Page 4Linked to original sources

arXiv2025

Splatonic: Architecture Support for 3D Gaussian Splatting SLAM via Sparse Processing

3D Gaussian splatting (3DGS) has emerged as a promising direction for SLAM due to its high-fidelity reconstruction and rapid convergence. However, 3DGS-SLAM algorithms remain impractical for mobile platforms due to their high computational cost, especially for their tracking process. This work introduces Splatonic, a sparse and efficient real-time 3DGS-SLAM algorithm-hardware co-design for resource-constrained devices. Inspired by classical SLAMs, we propose an adaptive sparse pixel sampling algorithm that reduces the number of rendered pixels by up to 256$\times$ while retaining accuracy. To unlock this performance potential on mobile GPUs, we design a novel pixel-based rendering pipeline that improves hardware utilization via Gaussian-parallel rendering and preemptive $α$-checking. Together, these optimizations yield up to 121.7$\times$ speedup on the bottleneck stages and 14.6$\times$ end-to-end speedup on off-the-shelf GPUs. To further address new bottlenecks introduced by our rendering pipeline, we propose a pipelined architecture that simplifies the overall design while addressing newly emerged bottlenecks in projection and aggregation. Evaluated across four 3DGS-SLAM algorithms, Splatonic achieves up to 274.9$\times$ speedup and 4738.5$\times$ energy savings over mobile GPUs and up to 25.2$\times$ speedup and 241.1$\times$ energy savings over state-of-the-art accelerators, all with comparable accuracy.

cs.AR↗

arXiv2025

Water induced bandgap engineering in nanoribbons of hexagonal boron nitride

Different from hexagonal boron nitride (hBN) sheets, the bandgap of hBN nanoribbons (BNNRs) can be changed by spatial/electrostatic confinement. It has been predicted that a transverse electric field can narrow the bandgap and even cause an insulator-metal transition in BNNRs. However, experimentally introducing an overhigh electric field across the BNNR remains challenging. Here, we theoretically and experimentally demonstrate that water adsorption greatly reduces bandgap of zigzag oriented BNNRs (zBNNRs). Ab initio calculations show that water adsorbed beside the BNNR induces a transverse equivalent electric field of over 2 V/nm thereby reducing its bandgap. Field effect transistors were successfully fabricated from zBNNRs with different widths. The conductance of zBNNRs with adsorbates of water could be tuned over 3 orders in magnitude via electrical field modulation at room temperature. Furthermore, photocurrent response measurements were taken to determine the optical bandgap in zBNNR. Wider zBNNRs exhibit a bandgap down to 1.17 eV. This study yields fundamental insights in new routes toward realizing electronic/optoelectronic devices and circuits based on hexagonal boron nitride.

cond-mat.mtrl-sci↗

arXiv2025

Pronounced scale-dependent charge carrier density in graphene quantum Hall devices

The miniaturization of quantum Hall resistance standards (QHRS) using epitaxial graphene on silicon carbide necessitates understanding how device dimensions impact performance. This study reveals a pronounced scale-dependent carrier density in graphene Hall devices: under electron doping, carrier density decreases with increasing channel width (Wd), while the opposite occurs under hole doping. This phenomenon, most significant for Wd less than 400 um, directly influences the onset of magnetic field required for quantization. Fermi velocity measurements and angle-resolved photoemission spectroscopy (ARPES) analysis indicate that band structure modifications and electron-electron interactions underlie this size dependence. Utilizing machine learning with limited data, we optimized the device geometry, identifying a channel width of ~360 um as the optimal balance between resistance uncertainty and on-chip integration density. This work provides key insights for designing high-performance, miniaturized graphene-based QHRS arrays.

cond-mat.mes-hall↗

arXiv2025

Signatures of magnetism in zigzag graphene nanoribbon embedded in h-BN lattice

Zigzag edges of graphene have long been predicted to exhibit magnetic electronic state near the Fermi level, which can cause spin-related phenomena and offer unique potentials for graphene-based spintronics. However, the magnetic conduction channels along these edges have yet been reported experimentally. Here, we report the observation on signatures of magnetism in zigzag graphene nanoribbons (zGNRs) embedded in hexagonal boron nitride (h-BN). The in-plane bonding with BN can stabilize the edges of zGNRs, and thus enable a direct probing of the intrinsic magnetism. Firstly, the presence of magnetism of a zGNR was confirmed by scanning NV center microscopy. And then, zGNR was fabricated into a transistor with a width of ~9 nm wide and a channel length of sub-50 nm. By performing magneto-transport measurements, Fabry-Pérot interference patterns were observed in the transistor at 4 Kelvin, which indicates a coherent transport through the channel. A large magnetoresistance of ~175 Ω, corresponding to a ratio of ~1.3 %, was observed at the same temperature. More importantly, such magneto-transport signal is highly anisotropic on the magnetic field direction, and its appearance extends well above room temperature. All these evidences corroborate the existence of robust magnetic ordering in the edge state of zGNR. The findings on zGNR embedded in h-BN provide an effective platform for the future exploration of graphene-based spintronic devices.

cond-mat.mes-hall↗

arXiv2025

VeriCoT: Neuro-symbolic Chain-of-Thought Validation via Logical Consistency Checks

LLMs can perform multi-step reasoning through Chain-of-Thought (CoT), but they cannot reliably verify their own logic. Even when they reach correct answers, the underlying reasoning may be flawed, undermining trust in high-stakes scenarios. To mitigate this issue, we introduce VeriCoT, a neuro-symbolic method that extracts and verifies formal logical arguments from CoT reasoning. VeriCoT formalizes each CoT reasoning step into first-order logic and identifies premises that ground the argument in source context, commonsense knowledge, or prior reasoning steps. The symbolic representation enables automated solvers to verify logical validity while the NL premises allow humans and systems to identify ungrounded or fallacious reasoning steps. Experiments on the ProofWriter, LegalBench, and BioASQ datasets show VeriCoT effectively identifies flawed reasoning, and serves as a strong predictor of final answer correctness. We also leverage VeriCoT's verification signal for (1) inference-time self-reflection, (2) supervised fine-tuning (SFT) on VeriCoT-distilled datasets and (3) preference fine-tuning (PFT) with direct preference optimization (DPO) using verification-based pairwise rewards, further improving reasoning validity and accuracy.

cs.AI↗

arXiv2025

HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation

Standard Retrieval-Augmented Generation (RAG) relies on chunk-based retrieval, whereas GraphRAG advances this approach by graph-based knowledge representation. However, existing graph-based RAG approaches are constrained by binary relations, as each edge in an ordinary graph connects only two entities, limiting their ability to represent the n-ary relations (n >= 2) in real-world knowledge. In this work, we propose HyperGraphRAG, a novel hypergraph-based RAG method that represents n-ary relational facts via hyperedges, and consists of knowledge hypergraph construction, retrieval, and generation. Experiments across medicine, agriculture, computer science, and law demonstrate that HyperGraphRAG outperforms both standard RAG and previous graph-based RAG methods in answer accuracy, retrieval efficiency, and generation quality. Our data and code are publicly available at https://github.com/LHRLAB/HyperGraphRAG.

cs.AI↗

arXiv2025

Rethinking LLM Uncertainty: A Multi-Agent Approach to Estimating Black-Box Model Uncertainty

Quantifying uncertainty in black-box LLMs is vital for reliable responses and scalable oversight. Existing methods, which gauge a model's uncertainty through evaluating self-consistency in responses to the target query, can be misleading: an LLM may confidently provide an incorrect answer to a target query, yet give a confident and accurate answer to that same target query when answering a knowledge-preserving perturbation of the query. We systematically analyze the model behaviors and demonstrate that this discrepancy stems from suboptimal retrieval of parametric knowledge, often due to contextual biases that prevent consistent access to stored knowledge. We then introduce DiverseAgentEntropy, a novel, theoretically-grounded method employing multi-agent interaction across diverse query variations for uncertainty estimation of black-box LLMs. This approach more accurately assesses an LLM's true uncertainty and improves hallucination detection, outperforming existing self-consistency based techniques.

cs.CL↗

arXiv2025

Homomorphic Mappings for Value-Preserving State Aggregation in Markov Decision Processes

State aggregation aims to reduce the computational complexity of solving Markov Decision Processes (MDPs) while preserving the performance of the original system. A fundamental challenge lies in optimizing policies within the aggregated, or abstract, space such that the performance remains optimal in the ground MDP-a property referred to as {"}optimal policy equivalence {"}. This paper presents an abstraction framework based on the notion of homomorphism, in which two Markov chains are deemed homomorphic if their value functions exhibit a linear relationship. Within this theoretical framework, we establish a sufficient condition for the equivalence of optimal policy. We further examine scenarios where the sufficient condition is not met and derive an upper bound on the approximation error and a performance lower bound for the objective function under the ground MDP. We propose Homomorphic Policy Gradient (HPG), which guarantees optimal policy equivalence under sufficient conditions, and its extension, Error-Bounded HPG (EBHPG), which balances computational efficiency and the performance loss induced by aggregation. In the experiments, we validated the theoretical results and conducted comparative evaluations against seven algorithms.

cs.LG↗

arXiv2025

Automated Repair of OpenID Connect Programs (Extended Version)

OpenID Connect has revolutionized online authentication based on single sign-on (SSO) by providing a secure and convenient method for accessing multiple services with a single set of credentials. Despite its widespread adoption, critical security bugs in OpenID Connect have resulted in significant financial losses and security breaches, highlighting the need for robust mitigation strategies. Automated program repair presents a promising solution for generating candidate patches for OpenID implementations. However, challenges such as domain-specific complexities and the necessity for precise fault localization and patch verification must be addressed. We propose AuthFix, a counterexample-guided repair engine leveraging LLMs for automated OpenID bug fixing. AuthFix integrates three key components: fault localization, patch synthesis, and patch verification. By employing a novel Petri-net-based model checker, AuthFix ensures the correctness of patches by effectively modeling interactions. Our evaluation on a dataset of OpenID bugs demonstrates that AuthFix successfully generated correct patches for 17 out of 23 bugs (74%), with a high proportion of patches semantically equivalent to developer-written fixes.

cs.SE↗

arXiv2025

Voyager: Real-Time Splatting City-Scale Gaussians on Resource-Constrained Devices

3D Gaussian splatting (3DGS) is an emerging technique for photorealistic 3D scene rendering. However, rendering city-scale 3DGS scenes on resource-constrained mobile devices in real-time remains a significant challenge due to two compute-intensive stages: level-of-detail (LoD) search and rasterization. In this paper, we propose Voyager, an effective solution to accelerate city-scale 3DGS rendering on mobile devices. Our key insight is that, under normal user motion, the number of newly visible Gaussians within the view frustum remains roughly constant. Leveraging this temporal correlation, we propose a temporal-aware LoD search to identify the necessary Gaussians for the remaining rendering stages. For the remaining rendering process, we accelerate the bottleneck stage, rasterization, via preemptive $α$-filtering. With all optimizations above, our system can deliver low-latency, city-scale 3DGS rendering on mobile devices. Compared to existing solutions, Voyager achieves up to 6.6$\times$ speedup and 85\% energy savings with superior rendering quality.

cs.GR↗

arXiv2025

Astraea: A Token-wise Acceleration Framework for Video Diffusion Transformers

Video diffusion transformers (vDiTs) have made tremendous progress in text-to-video generation, but their high compute demands pose a major challenge for practical deployment. While studies propose acceleration methods to reduce workload at various granularities, they often rely on heuristics, limiting their applicability. We introduce Astraea, a framework that searches for near-optimal configurations for vDiT-based video generation under a performance target. At its core, Astraea proposes a lightweight token selection mechanism and a memory-efficient, GPU-friendly sparse attention strategy, enabling linear savings on execution time with minimal impact on generation quality. Meanwhile, to determine optimal token reduction for different timesteps, we further design a search framework that leverages a classic evolutionary algorithm to automatically determine the distribution of the token budget effectively. Together, Astraea achieves up to 2.4$\times$ inference speedup on a single GPU with great scalability (up to 13.2$\times$ speedup on 8 GPUs) while achieving up to over 10~dB video quality compared to the state-of-the-art methods ($<$0.5\% loss on VBench compared to baselines).

cs.CV↗

arXiv2025

Compact relative $\mathrm{SO}_0(2,q)$-character varieties of punctured spheres

We prove that there are relative $\mathrm{SO}_0(2,q)$-character varieties of the punctured sphere which are compact, totally non-hyperbolic and contain a dense representation. This work fills a remaining case of the results of N. Tholozan and J. Toulisse. Our approach relies on the non-abelian Hodge correspondence and we study the moduli space of parabolic $\mathrm{SO}_0(2,q)$-Higgs bundles with some fixed weight. Additionally, we provide a construction based on Geometric Invariant Theory (GIT) to demonstrate that the considered moduli spaces can be viewed as a projective variety over $\mathbb{C}$.

math.DG↗

arXiv2025

Beyond Random Masking: A Dual-Stream Approach for Rotation-Invariant Point Cloud Masked Autoencoders

Existing rotation-invariant point cloud masked autoencoders (MAE) rely on random masking strategies that overlook geometric structure and semantic coherence. Random masking treats patches independently, failing to capture spatial relationships consistent across orientations and overlooking semantic object parts that maintain identity regardless of rotation. We propose a dual-stream masking approach combining 3D Spatial Grid Masking and Progressive Semantic Masking to address these fundamental limitations. Grid masking creates structured patterns through coordinate sorting to capture geometric relationships that persist across different orientations, while semantic masking uses attention-driven clustering to discover semantically meaningful parts and maintain their coherence during masking. These complementary streams are orchestrated via curriculum learning with dynamic weighting, progressing from geometric understanding to semantic discovery. Designed as plug-and-play components, our strategies integrate into existing rotation-invariant frameworks without architectural changes, ensuring broad compatibility across different approaches. Comprehensive experiments on ModelNet40, ScanObjectNN, and OmniObject3D demonstrate consistent improvements across various rotation scenarios, showing substantial performance gains over the baseline rotation-invariant methods.

cs.CV↗

arXiv2025

Decomposition of global 2-SLE for $κ\in (4,8)$ and an application for critical FK-Ising model

We consider global 2-SLE$_κ$ $(η_1, η_2)$ in a topological rectangle with $κ\in (4,8)$. We derive the law of a random hitting point of the curves and show that, conditional on this random hitting point, the pair of two curves has the same law as Gaussian free field flow lines with proper boundary data. Using a similar idea, we derive the asymptotic of the probability for $η_1\capη_2=\emptyset$. As an application, we derive the asymptotic of the probability for the existence of two disjoint open paths in critical FK-Ising model.

math.PR↗

arXiv2025

Conformally covariant probabilities, operator product expansions, and logarithmic correlations in two-dimensional critical percolation

The large-scale behavior of two-dimensional critical percolation is expected to be described by a conformal field theory (CFT). Moreover, this putative CFT is believed to be of the logarithmic type, exhibiting logarithmic corrections to the most commonly encountered behavior of CFT correlations. While constructing a full-fledged percolation CFT is still an open problem, in this paper we prove various CFT features of the scaling limit of two-dimensional critical percolation. In particular, we provide the first rigorous proof of the emergence of logarithmic singularities in the scaling limit of connection probabilities. More precisely, we study several connectivity events, including arm-events and the events that a vertex is pivotal or belongs to the percolation backbone, whose probabilities have conformally covariant scaling limits and can be interpreted as CFT correlation functions. For some of these probabilities, we prove asymptotic expansions that can be regarded as CFT operator product expansions (OPEs). Our analysis identifies various logarithmic singularities and explains the geometric mechanism that produces them. In follow-up work, the results of this paper are used to define a percolation energy field and its logarithmic partner.

math-ph↗

arXiv2025

ClusterFusion: Expanding Operator Fusion Scope for LLM Inference via Cluster-Level Collective Primitive

Large language model (LLM) decoding suffers from high latency due to fragmented execution across operators and heavy reliance on off-chip memory for data exchange and reduction. This execution model limits opportunities for fusion and incurs significant memory traffic and kernel launch overhead. While modern architectures such as NVIDIA Hopper provide distributed shared memory and low-latency intra-cluster interconnects, they expose only low-level data movement instructions, lacking structured abstractions for collective on-chip communication. To bridge this software-hardware gap, we introduce two cluster-level communication primitives, ClusterReduce and ClusterGather, which abstract common communication patterns and enable structured, high-speed data exchange and reduction between thread blocks within a cluster, allowing intermediate results to be on-chip without involving off-chip memory. Building on these abstractions, we design ClusterFusion, an execution framework that schedules communication and computation jointly to expand operator fusion scope by composing decoding stages such as QKV Projection, Attention, and Output Projection into a single fused kernels. Evaluations on H100 GPUs show that ClusterFusion outperforms state-of-the-art inference frameworks by 1.61x on average in end-to-end latency across different models and configurations. The source code is available at https://github.com/xinhao-luo/ClusterFusion.

cs.DC↗

arXiv2025

SLTarch: Towards Scalable Point-Based Neural Rendering by Taming Workload Imbalance and Memory Irregularity

Rendering is critical in fields like 3D modeling, AR/VR, and autonomous driving, where high-quality, real-time output is essential. Point-based neural rendering (PBNR) offers a photorealistic and efficient alternative to conventional methods, yet it is still challenging to achieve real-time rendering on mobile platforms. We pinpoint two major bottlenecks in PBNR pipelines: LoD search and splatting. LoD search suffers from workload imbalance and irregular memory access, making it inefficient on off-the-shelf GPUs. Meanwhile, splatting introduces severe warp divergence across GPU threads due to its inherent sparsity. To tackle these challenges, we propose SLTarch, an algorithm-architecture co-designed framework. At its core, SLTarch introduces SLTree, a dedicated subtree-based data structure, and LTcore, a specialized hardware architecture tailored for efficient LoD search. Additionally, we co-design a divergence-free splatting algorithm with our simple yet principled hardware augmentation, SPcore, to existing PBNR accelerators. Compared to a mobile GPU, SLTarch achieves 3.9$\times$ speedup and 98\% energy savings with negligible architecture overhead. Compared to existing accelerator designs, SLTarch achieves 1.8$\times$ speedup with 54\% energy savings.

cs.AR↗

arXiv2025

Conformal covariance of connection probabilities in the 2D critical FK-Ising model

We study connection probabilities between vertices of the square lattice for the critical random-cluster (FK) model with cluster weight 2, which is related to the critical Ising model. We consider the model on the plane and on domains conformally equivalent to the upper half-plane. We prove that, when appropriately rescaled, the connection probabilities between vertices in the domain or on the boundary have nontrivial limits, as the mesh size of the square lattice is sent to zero, and that those limits are conformally covariant. This provides an important step in the proof of the Delfino-Viti conjecture for FK-Ising percolation as well as an alternative proof of the conformal covariance of the Ising spin correlation functions. In an appendix, we also derive new exact formulas for some Ising boundary spin correlation functions.

math.PR↗