SearcharxivSearch

arXiv subjects

Yi Kang

Publications and source records attributed to Yi Kang.

At least 19 recordsLinked to original sources

DORA: Dynamic Online Reinforcement Agent for Token Merging in Vision Transformers

Vision Transformers (ViTs) incur significant computational overhead due to the quadratic complexity of self-attention relative to the token sequence length. While existing token reduction methods mitigate this issue, they predominantly rely on fixed heuristic metrics, predefined ratios, or static offline masks, which lack the adaptability to capture input-dependent redundancy during inference. In this paper, we propose DORA (Dynamic Online Reinforcement Agent), the first reinforcement learning (RL)-driven online inference framework for dynamic token merging in ViTs. We formulate the merging process as a sequential Markov Decision Process (MDP), where a lightweight RL agent determines the merging strategy for each Transformer block based on the current feature state and layer-specific context. To balance computational efficiency and feature fidelity, the agent is optimized via a dense reward function incorporating a non-linear distillation-based penalty. We implement an asymmetric Actor-Critic architecture that utilizes a high-capacity Critic for stable offline training while retaining a minimal Actor head for low-computation online inference. Evaluations across multiple ViT scales (Tiny to Large) demonstrate that DORA improves the accuracy-efficiency Pareto front compared to current baselines. Under strict negligible accuracy-drop constraints (<= 0.05%), DORA achieves up to a 12.66% token merging rate, and delivers up to a 569.7% relative improvement over the most efficient baseline. On ImageNet-1K, under aligned accuracy constraints, DORA achieves up to a 76% relative improvement in computational savings compared to state-of-the-art methods. Furthermore, on out-of-distribution (OOD) benchmarks such as ImageNet-A and ImageNet-C, DORA attains a relative efficiency advantage of over 430%.

cs.CV

The Impact of Cosmic Variance and Satellites on JWST Clustering Measurements at Redshift around 6

We present a framework for inferring the dark matter halo masses of quasars and [O III]-emitting galaxies from JWST/NIRCam Wide Field Slitless Spectroscopy (WFSS) clustering measurements at z approximately 6. Using the FLAMINGO-10k N-body simulation, we construct mock realizations of quasar and galaxy catalogs that incorporate realistic selection functions, spatial coverage, and sensitivity limits matched to the ASPIRE survey. These mocks enable accurate measurements of the quasar-galaxy cross-correlation and galaxy auto-correlation functions, with covariance matrices derived from 1000 realizations that capture both cosmic variance and bin-to-bin correlations. We employ Bayesian inference to fit the correlation functions and infer the minimum halo masses for quasars and galaxies. Our results demonstrate that Poisson pair-count uncertainties, commonly adopted in high-redshift clustering studies, significantly underestimate the true measurement errors. The dominant missing component is cosmic variance: even the diagonal of the full covariance matrix exceeds the Poisson expectation, with off-diagonal bin-to-bin correlations contributing a smaller additional correction. In particular, 1) the commonly used Poisson error on the correlation functions underestimates the true uncertainty by a factor of approximately 3; 2) the uncertainties on the inferred minimum halo masses are underestimated by a factor of approximately 1.5-3 when adopting Poisson errors instead of the full covariance matrix; 3) the inferred QSO halo mass is robust to whether central and satellite [O III]-emitters share a common mass threshold. Our framework provides a more complete error budget for JWST/WFSS clustering analyses, enabling robust constraints on the host halo masses and duty cycles of high-redshift quasars and emission-line galaxies.

astro-ph.CO

SLaB: Sparse-Lowrank-Binary Decomposition for Efficient Large Language Models

The rapid growth of large language models (LLMs) presents significant deployment challenges due to their massive computational and memory demands. While model compression, such as network pruning, offers potential solutions, most existing methods often fail to maintain good performance at high compression ratios. To address this, we propose SLaB, a novel framework that decomposes each linear layer weight into three complementary components: a sparse matrix, a low-rank matrix, and a binary matrix. SLaB eliminates the need for retraining and leverages activation-aware pruning scores to guide the decomposition process. Experiments on Llama-family models demonstrate that SLaB achieves state-of-the-art performance, reducing perplexity by up to 36% compared to existing methods at 50% compression and improving accuracy by up to 8.98% over the baseline on zero-shot tasks.

cs.LG

Clustering of z~6.6 Quasars and [O III] Emitters Constrains Host Halo Masses and Duty Cycles in 25 ASPIRE Fields

We use data from the JWST ASPIRE Wide Field Slitless Spectroscopy (WFSS) program to measure the auto-correlation function of [O,{\sc iii}] emitters at 5.3$<z<$7.0 and the quasar--[O,{\sc iii}] emitter cross-correlation around 25 ASPIRE quasars (6.51$<z<$6.82; $\langle z\rangle=6.6$). We use synthetic source injection to calibrate the selection function, which we combine with the large-volume FLAMINGO-10k simulation (2.8,cGpc box) to construct realistic mock observations. Our simulation-based approach captures nonlinear structure growth and scale-dependent bias on small scales and derives covariance matrices that include cosmic variance. The clustering yields correlation lengths of $r_0^{\rm GG}=4.7^{+0.4}{-0.5},h^{-1}$,cMpc for the [O,{\sc iii}] auto-correlation with fixed slope $\gamma{\rm GG}=1.8$, and $r_0^{\rm QG}=8.7^{+0.8}{-0.9},h^{-1}$,cMpc for the quasar--[O,{\sc iii}] cross-correlation with $\gamma{\rm QG}=2.0$. We infer $\log(M_{h,{\rm min}}^{[{\rm O,III}]}/M_\odot)=10.5^{+0.1}{-0.1}$ for [O,{\sc iii}] emitters and $\log(M{h,{\rm min}}^{\rm QSO}/M_\odot)=12.1^{+0.3}{-0.4}$ for quasars. These imply duty cycles of $2.5^{+1.0}{-0.8}$,per,cent for [O,{\sc iii}] emitters and $0.3^{+4.0}{-0.3}$,per,cent for quasars, corresponding to UV-bright lifetimes of $t{\rm Q}=2.6^{+30}_{-2.5}$,Myr (less than 10,per,cent of a Salpeter $e$-folding time). The results indicate that the observed UV-luminous phase contributes little to total SMBH growth, placing tight constraints on early black-hole formation.

astro-ph.GA

SASQ: Static Activation Scaling for Quantization-Aware Training in Large Language Models

Large language models (LLMs) excel at natural language tasks but face deployment challenges due to their growing size outpacing GPU memory advancements. Model quantization mitigates this issue by lowering weight and activation precision, but existing solutions face fundamental trade-offs: dynamic quantization incurs high computational overhead and poses deployment challenges on edge devices, while static quantization sacrifices accuracy. Existing approaches of quantization-aware training (QAT) further suffer from weight training costs. We propose SASQ: a lightweight QAT framework specifically tailored for activation quantization factors. SASQ exclusively optimizes only the quantization factors (without changing pre-trained weights), enabling static inference with high accuracy while maintaining deployment efficiency. SASQ adaptively truncates some outliers, thereby reducing the difficulty of quantization while preserving the distributional characteristics of the activations. SASQ not only surpasses existing SOTA quantization schemes but also outperforms the corresponding FP16 models. On LLaMA2-7B, it achieves 5.2% lower perplexity than QuaRot and 4.7% lower perplexity than the FP16 model on WikiText2.

cs.CL

HQ-DM: Single Hadamard Transformation-Based Quantization-Aware Training for Low-Bit Diffusion Models

Diffusion models have demonstrated significant applications in the field of image generation. However, their high computational and memory costs pose challenges for deployment. Model quantization has emerged as a promising solution to reduce storage overhead and accelerate inference. Nevertheless, existing quantization methods for diffusion models struggle to mitigate outliers in activation matrices during inference, leading to substantial performance degradation under low-bit quantization scenarios. To address this, we propose HQ-DM, a novel Quantization-Aware Training framework that applies Single Hadamard Transformation to activation matrices. This approach effectively reduces activation outliers while preserving model performance under quantization. Compared to traditional Double Hadamard Transformation, our proposed scheme offers distinct advantages by seamlessly supporting INT convolution operations while preventing the amplification of weight outliers. For conditional generation on the ImageNet 256x256 dataset using the LDM-4 model, our W4A4 and W4A3 quantization schemes improve the Inception Score by 12.8% and 467.73%, respectively, over the existing state-of-the-art method.

cs.CV

SBS: Enhancing Parameter-Efficiency of Neural Representations for Neural Networks via Spectral Bias Suppression

Implicit neural representations have recently been extended to represent convolutional neural network weights via neural representation for neural networks, offering promising parameter compression benefits. However, standard multi-layer perceptrons used in neural representation for neural networks exhibit a pronounced spectral bias, hampering their ability to reconstruct high-frequency details effectively. In this paper, we propose SBS, a parameter-efficient enhancement to neural representation for neural networks that suppresses spectral bias using two techniques: (1) a unidirectional ordering-based smoothing that improves kernel smoothness in the output space, and (2) unidirectional ordering-based smoothing aware random fourier features that adaptively modulate the frequency bandwidth of input encodings based on layer-wise parameter count. Extensive evaluations on various ResNet models with datasets CIFAR-10, CIFAR-100, and ImageNet, demonstrate that SBS achieves significantly better reconstruction accuracy with less parameters compared to SOTA.

cs.LG

The Light Echo of a High-Redshift Quasar mapped with Lyman-$\alpha$ Tomography

Ultra-violet (UV) radiation from accreting black holes ionizes the intergalactic gas around early quasars, carving out highly ionized bubbles in their surroundings. Any changes in a quasar's luminosity are therefore predicted to produce outward-propagating ionization gradients, affecting the Lyman-$\alpha$ (Ly$\alpha$) absorption opacity near the quasar's systemic redshift. This "proximity effect" is well-documented in rest-UV quasar spectra but only provides a one-dimensional probe along our line-of-sight. Here we present deep spectroscopic observations with the James Webb Space Telescope (JWST) of galaxies in the background of a super-luminous quasar at $z_{\rm QSO}\approx6.3$, which reveal the quasar's "light echo" with Ly$\alpha$ tomography in the transverse direction. This transverse proximity effect is detected for the first time towards multiple galaxy sightlines, allowing us to map the extent and geometry of the quasar's ionization cone. We obtain constraints on the orientation and inclination of the cone, as well as an upper limit on the obscured solid angle fraction of $f_{\rm obsc}<91\%$. Additionally, we find a timescale of the quasar's UV radiation of $t_{\rm QSO}=10^{5.6^{+0.1}_{-0.3}}$ years, which is significantly shorter than would be required to build up the central supermassive black hole (SMBH) with conventional growth models, but is consistent with independent measurements of the quasars' duty cycle. Our inferred obscured fraction disfavors a scenario where short quasar lifetimes can be explained exclusively by geometric obscuration, and instead supports the idea that radiatively inefficient accretion or growth in initially heavily enshrouded cocoons plays a pivotal role in early SMBH growth. Our results pave the way for novel studies of quasars' ionizing geometries and radiative histories at early cosmic times.

astro-ph.GA

Low-Energy Boundary-State Emergence and Delocalization in Finite-sized Mosaic Wannier-Stark Lattices

The mosaic Wannier Stark lattice has gained increasing prominence as a disorder free system exhibiting unconventional localization behavior induced by spatially periodic Stark potentials. In the infinite size limit, exact spectral analysis reveals an almost pure point spectrum. There is no true mobility edge, except for (M 1) isolated extended states, which are accompanied by weakly localized modes with diverging localization lengths. Motivated by this spectral structure, we investigate the mosaic Wannier Stark model under finite-size. In such systems, additional low energy boundary localized states emerge due to boundary residuals when the system length is not commensurate with the modulation period. These states are effectively distinguished and identified using the inverse participation ratio (IPR) and spatial expectation values. To explore their response to non-Hermitian perturbations, complex on site potentials are introduced to simulate gain and loss. As the non-Hermitian strength increases, only the weakly localized states undergo progressive delocalization, exhibiting a smooth crossover from localization to spatial extension.

cond-mat.other

SparseMap: Loop Mapping for Sparse CNNs on Streaming Coarse-grained Reconfigurable Array

Streaming coarse-grained reconfgurable array (CGRA) is a promising architecture for data/computing-intensive applications because of its fexibility, high throughput and efcient memory system. However,when accelerating sparse CNNs, the irregular input data demands inside sparse CNNs would cause excessive caching operations (COPs) and multi-cycle internal dependencies (MCIDs) between operations, declining the throughput of the streaming CGRA. We propose a mapping method for sparse CNNs onto streaming CGRA, SparseMap, which incorporates an efcient I/O data management along with operation scheduling and binding, to reduce the COPs and MCIDs, thereby ensuring the optimal throughput of streaming CGRA.The experimental results show SparseMap reduces 92.5% COPs and 46.0 % MCIDs while achieves the same or even smaller initiation interval (II) compared to previous works.

cs.DC

Extreme Deconvolution Reimagined: Conditional Densities via Neural Networks and an Application in Quasar Classification

Density estimation is a fundamental problem that arises in many areas of astronomy, with applications ranging from selecting quasars using color distributions to characterizing stellar abundances. Astronomical observations are inevitably noisy; however, the density of a noise-free feature is often the desired outcome. The extreme-deconvolution (XD) method can be used to deconvolve the noise and obtain noise-free density estimates by fitting a mixture of Gaussians to data where each sample has non-identical (heteroscedastic) Gaussian noise. However, XD does not generalize to cases where some feature dimensions have highly non-Gaussian distribution, and no established method exists to overcome this limitation. We introduce a possible solution using neural networks to perform Gaussian mixture modeling of the Gaussian-like dimensions conditioned on those non-Gaussian features. The result is the CondXD algorithm, a generalization of XD that performs noise-free conditional density estimation. We apply CondXD to a toy model and find that it is more accurate than other approaches. We further test our method on a real-world high redshift quasar versus contaminant classification problem. Specifically, we estimate noise-free densities in flux-ratio (i.e., color) space for contaminants, conditioned on their magnitude. Our results are comparable to the existing method, which divides the samples into magnitude bins and applies XD separately in each bin, and our method is approximately ten times faster. Overall, our method has the potential to significantly improve estimating conditional densities and enable new discoveries in astronomy.

astro-ph.IM

Graph Attention-Based Symmetry Constraint Extraction for Analog Circuits

In recent years, analog circuits have received extensive attention and are widely used in many emerging applications. The high demand for analog circuits necessitates shorter circuit design cycles. To achieve the desired performance and specifications, various geometrical symmetry constraints must be carefully considered during the analog layout process. However, the manual labeling of these constraints by experienced analog engineers is a laborious and time-consuming process. To handle the costly runtime issue, we propose a graph-based learning framework to automatically extract symmetric constraints in analog circuit layout. The proposed framework leverages the connection characteristics of circuits and the devices' information to learn the general rules of symmetric constraints, which effectively facilitates the extraction of device-level constraints on circuit netlists. The experimental results demonstrate that compared to state-of-the-art symmetric constraint detection approaches, our framework achieves higher accuracy and F1-score.

cs.LG

Allspark: Workload Orchestration for Visual Transformers on Processing In-Memory Systems

The advent of Transformers has revolutionized computer vision, offering a powerful alternative to convolutional neural networks (CNNs), especially with the local attention mechanism that excels at capturing local structures within the input and achieve state-of-the-art performance. Processing in-memory (PIM) architecture offers extensive parallelism, low data movement costs, and scalable memory bandwidth, making it a promising solution to accelerate Transformer with memory-intensive operations. However, the crucial issue lies in efficiently deploying an entire model onto resource-limited PIM system while parallelizing each transformer block with potentially many computational branches based on local-attention mechanisms. We present Allspark, which focuses on workload orchestration for visual Transformers on PIM systems, aiming at minimizing inference latency. Firstly, to fully utilize the massive parallelism of PIM, Allspark employs a fine-grained partitioning scheme for computational branches, and formats a systematic layout and interleaved dataflow with maximized data locality and reduced data movement. Secondly, Allspark formulates the scheduling of the complete model on a resource-limited distributed PIM system as an integer linear programming (ILP) problem. Thirdly, as local-global data interactions exhibit complex yet regular dependencies, Allspark provides a two-stage placement method, which simplifies the challenging placement of computational branches on the PIM system into the structured layout and greedy-based binding, to minimize NoC communication costs. Extensive experiments on 3D-stacked DRAM-based PIM systems show that Allspark brings 1.2x-24.0x inference speedup for various visual Transformers over baselines. Compared to Nvidia V100 GPU, Allspark-enriched PIM system yields average speedups of 2.3x and energy savings of 20x-55x.

cs.AR

IOPS: An Unified SpMM Accelerator Based on Inner-Outer-Hybrid Product

Sparse matrix multiplication (SpMM) is widely applied to numerous domains, such as graph processing, machine learning, and data analytics. However, inner product based SpMM induces redundant zero-element computing for mismatched nonzero operands, while outer product based approach lacks input reuse across Process Elements (PEs) and poor output locality for accumulating partial sum (psum) matrices. Besides, current works only focus on sparse-sparse matrix multiplication (SSMM) or sparse-dense matrix multiplication (SDMM), rarely performing efficiently for both. To address these problems, this paper proposes an unified SpMM accelerator, called IOPS, hybridizing inner with outer products. It reuses the input matrix among PEs with inner product dataflow, and removes zero-element calculations with outer product approach in each PE, which can efficiently process SSMM and SDMM. Moreover, an address mapping method is designed to accumulate the irregular sparse psum matrices, reducing the latency and DRAM access of psum accumulating. Furthermore, an adaptive partition strategy is proposed to tile the input matrices based on their sparsity ratios, effectively utilizing the storage of architecture and reducing DRAM access. Compared with the SSMM accelerator, SpArch, we achieve 1.7x~6.3x energy efficiency and 1.2x~4.4x resource efficiency, with 1.4x~2.1x DRAM access saving.

cs.AR

YOCO: A Hybrid In-Memory Computing Architecture with 8-bit Sub-PetaOps/W In-Situ Multiply Arithmetic for Large-Scale AI

In this paper, we further explore the potential of analog in-memory computing (AiMC) and introduce an innovative artificial intelligence (AI) accelerator architecture named YOCO, featuring three key proposals: (1) YOCO proposes a novel 8-bit in-situ multiply arithmetic (IMA) achieving 123.8 TOPS/W energy-efficiency and 34.9 TOPS throughput through efficient charge-domain computation and timedomain accumulation mechanism. (2) YOCO employs a hybrid ReRAM-SRAM memory structure to balance computational efficiency and storage density. (3) YOCO tailors an IMC-friendly attention computing flow with an efficient pipeline to accelerate the inference of transformer-based AI models. Compared to three SOTA baselines, YOCO on average improves energy efficiency by up to 3.9x-19.9x and throughput by up to 6.8x-33.6x across 10 CNN/transformer models.

cs.AR

BandMap: Application Mapping with Bandwidth Allocation forCoarse-Grained Reconfigurable Array

This paper proposes an application mapping algorithm, BandMap, for coarse-grained reconfigurable array (CGRA), which allocates the bandwidth in PE array according to the transferring demands of data, especially the data with high spatial reuse, to reduce the routing PEs. To cover bandwidth allocation, BandMap maps the data flow graphs (DFGs), abstracted from applications, by solving the maximum independent set (MIS) on a mixture of tuple and quadruple resource occupation conflict graph. Compared to a state-of-art BusMap work, Bandmap can achieve reduced routing PEs with the same or even smaller initiation interval (II).

cs.DC

NicePIM: Design Space Exploration for Processing-In-Memory DNN Accelerators with 3D-Stacked-DRAM

With the widespread use of deep neural networks(DNNs) in intelligent systems, DNN accelerators with high performance and energy efficiency are greatly demanded. As one of the feasible processing-in-memory(PIM) architectures, 3D-stacked-DRAM-based PIM(DRAM-PIM) architecture enables large-capacity memory and low-cost memory access, which is a promising solution for DNN accelerators with better performance and energy efficiency. However, the low-cost characteristics of stacked DRAM and the distributed manner of memory access and data storing require us to rebalance the hardware design and DNN mapping. In this paper, we propose NicePIM to efficiently explore the design space of hardware architecture and DNN mapping of DRAM-PIM accelerators, which consists of three key components: PIM-Tuner, PIM-Mapper and Data-Scheduler. PIM-Tuner optimizes the hardware configurations leveraging a DNN model for classifying area-compliant architectures and a deep kernel learning model for identifying better hardware parameters. PIM-Mapper explores a variety of DNN mapping configurations, including parallelism between branches of DNN, DNN layer partitioning, DRAM capacity allocation and data layout pattern in DRAM to generate high-hardware-utilization DNN mapping schemes for various hardware configurations. The Data-Scheduler employs an integer-linear-programming-based data scheduling algorithm to alleviate the inter-PIM-node communication overhead of data-sharing brought by DNN layer partitioning. Experimental results demonstrate that NicePIM can optimize hardware configurations for DRAM-PIM systems effectively and can generate high-quality DNN mapping schemes with latency and energy cost reduced by 37% and 28% on average respectively compared to the baseline method.

cs.AR

Bit-balance: Model-Hardware Co-design for Accelerating NNs by Exploiting Bit-level Sparsity

Bit-serial architectures can handle Neural Networks (NNs) with different weight precisions, achieving higher resource efficiency compared with bit-parallel architectures. Besides, the weights contain abundant zero bits owing to the fault tolerance of NNs, indicating that bit sparsity of NNs can be further exploited for performance improvement. However, the irregular proportion of zero bits in each weight causes imbalanced workloads in the Processing Element (PE) array, which degrades performance or induces overhead for sparse processing. Thus, this paper proposed a bit-sparsity quantization method to maintain the bit sparsity ratio of each weight to no more than a certain value for balancing workloads, with little accuracy loss. Then, we co-designed a sparse bit-serial architecture, called Bit-balance, to improve overall performance, supporting weight-bit sparsity and adaptive bitwidth computation. The whole design was implemented with 65nm technology at 1 GHz and performs at 326-, 30-, 56-, and 218-frame/s for AlexNet, VGG-16, ResNet-50, and GoogleNet respectively. Compared with sparse bit-serial accelerator, Bitlet, Bit-balance achieves 1.8x~2.7x energy efficiency (frame/J) and 2.1x~3.7x resource efficiency (frame/mm2).

cs.AR