Searcharxiv⌕ Search

arXiv subjects

Yewon Jeong

Publications and source records attributed to Yewon Jeong.

4 recordsLinked to original sources
arXiv2026

HARP: Hadamard-Domain Write-and-Verify for Noise-Robust RRAM Programming

Write-and-verify (WV) is essential for programming multi-level RRAM weights, yet under scaled-voltage and low-SNR conditions the verify read increasingly limits mapping accuracy, convergence speed and energy. We propose a Hadamard-domain WV framework that improves verify reliability without adding analog hardware. % without introducing additional analog blocks % while leveraging the existing analog front-end \emph{HD-PV} (Hadamard-Encoded Parallel-Verify) replaces conventional one-hot verify reads with $N$ orthogonal Hadamard patterns for an $N$-cell column. Changing the read basis without increasing the column-level read count, inverse Hadamard decoding reduces uncorrelated read-noise variance by a factor of $N$ and cancels common-mode disturbances. \emph{HARP} (Hadamard-based ADC-Energy-Reduced Parallel-Verify) further exploits the fact that WV needs only ternary update decisions, not full digital codes, and replaces SAR conversions with lightweight compare-only operations. Across CIFAR-10, CIFAR-100, and keyword spotting under severe read noise, conventional WV loses over 20\,\% accuracy on CIFAR-10, while HD-PV and HARP limit the loss to 0.6\,\% and 1\,\% under the same memory footprint. Compared to conventional multi-read averaging for noise reduction, HD-PV and HARP achieve comparable accuracy with up to $6.1\times$ and $3.5\times$ lower latency and $6.2\times$ and $9.5\times$ better energy efficiency, respectively. To the best of our knowledge, this is the first application of Hadamard-encoded verification to RRAM WV.

cs.AR↗
arXiv2026

Jaguar: Fast Private CNN Inference with Power-of-Two Homomorphic Arithmetic

Hybrid HE/2PC private CNN inference remains bottlenecked by prime-modulus homomorphic arithmetic in convolution and by a precision flow that runs ReLU at doubled bitwidth before invoking a separate truncation protocol. We present Jaguar, a system built on a single design choice--a power-of-two ciphertext ring--that addresses both. The choice enables SPA-Conv, a coefficient-domain convolution kernel that replaces NTT-centric polynomial multiplication with scalar-polynomial accumulation, and an exact ciphertext-side truncation by local right shifts that lets ReLU run directly at the target fixed-point precision and eliminates the post-ReLU truncation protocol. Where NTT remains genuinely useful--at the client, for the single polynomial multiplication during decryption--we recover it through an auxiliary NTT prime, preserving the power-of-two protocol substrate while keeping decryption O(N log N). On ImageNet-scale ResNet-18, ResNet-50, and MobileNetV2 with AVX disabled, Jaguar achieves 2.07-3.72x lower end-to-end latency than Cheetah and 2.16-3.36x lower than Rhombus, with 1.16-1.76x lower communication than Cheetah.

cs.CR↗
arXiv2017

Moduli map of second fundamental forms on a nonsingular intersection of two quadrics

In [GH], Griffiths and Harris asked whether a projective complex submanifold of codimension two is determined by the moduli of its second fundamental forms. More precisely, given a nonsingular subvariety $X^n \subset {\mathbb P}^{n+2}$, the second fundamental form $II_{X,x}$ at a point $x \in X$ is a pencil of quadrics on $T_x(X)$, defining a rational map $μ^X$ from $X$ to a suitable moduli space of pencils of quadrics on a complex vector space of dimension $n$. The question raised by Griffiths and Harris was whether the image of $μ^X$ determines $X$. We study this question when $X^n \subset {\mathbb P}^{n+2}$ is a nonsingular intersection of two quadric hypersurfaces of dimension $n >4$. In this case, the second fundamental form $II_{X,x}$ at a general point $x \in X$ is a nonsingular pencil of quadrics. Firstly, we prove that the moduli map $μ^X$ is dominant over the moduli of nonsingular pencils of quadrics. This gives a negative answer to Griffiths-Harris's question. To remedy the situation, we consider a refined version $\widetildeμ^X$ of the moduli map $μ^X$, which takes into account the infinitesimal information of $μ^X$. Our main result is an affirmative answer in terms of the refined moduli map: we prove that the image of $\widetildeμ^X$ determines $X$, among nonsingular intersections of two quadrics.

math.AG↗