SearcharxivSearch

arXiv subjects

Jaeho Choi

Publications and source records attributed to Jaeho Choi.

11 recordsLinked to original sources

Can Language Models Understand mmWave Data? Benchmarking Large Language Models for mmWave Radar-Based Human Understanding

Large language models (LLMs) have shown remarkable reasoning and generative capabilities, motivating their use as universal reasoning engines for perception. While modern approaches such as vision-language models (VLMs) have attempted to incorporate reasoning capabilities into visual sensing, the integration of LLMs with the millimeter-wave (mmWave) modality-despite its unique advantages under low light and occlusion-remains largely unexplored. The principal bottlenecks stem from the scarcity of radar language pairs, severe cross-dataset heterogeneity, and the absence of a foundational mmWave encoder. We address this gap through a minimal textualization interface that serializes each mmWave point cloud into concise natural language, allowing off-the-shelf LLMs to operate in a question answering (QA) setting. Building on this, we present mmWave-QA, the first benchmark for language-conditioned mmWave human perception. mmWave-QA aggregates heterogeneous public mmWave datasets and harmonizes them via calibration-aware preprocessing and global taxonomy alignment, while providing natural language QA. Spanning six scenarios and five QA tasks, the benchmark enables standardized evaluation across diverse mmWave hardware and experimental conditions, establishing a foundation for scalable research on mmWave-LLM integration. We further evaluate and analyze LLMs on our mmWave-QA, highlighting their zero-shot reasoning potential for radar perception, as well as their robustness under visual degradation.

cs.AI

Does FOMC Tone Really Matter? Statistical Evidence from Spectral Graph Network Analysis

This study examines the relationship between Federal Open Market Committee (FOMC) announcements and financial market network structure through spectral graph theory. Using hypergraph networks constructed from S\&P 100 stocks around FOMC announcement dates (2011--2024), we employ the Fiedler value -- the second eigenvalue of the hypergraph Laplacian -- to measure changes in market connectivity and systemic stability. Our event study methodology reveals that FOMC announcements significantly alter network structure across multiple time horizons. Analysis of policy tone, classified using natural language processing, reveals heterogeneous effects: hawkish announcements induce network fragmentation at short horizons ($k=6$) followed by reconsolidation at medium horizons ($k=14$), while neutral statements show limited immediate impact but exhibit delayed fragmentation. These findings suggest that monetary policy communication affects market architecture through a network structural transmission, with effects varying by announcement timing and policy stance.

econ.GN

Advanced Torrential Loss Function for Precipitation Forecasting

Accurate precipitation forecasting is becoming increasingly important in the context of climate change. In response, machine learning-based approaches have recently gained attention as an emerging alternative to traditional methods such as numerical weather prediction and climate models. Nonetheless, many recent approaches still rely on off-the-shelf loss functions, and even the more advanced ones merely involve optimization processes based on the critical success index (CSI). The problem, however, is that CSI may become ineffective during extended dry periods when precipitation remains below the threshold, rendering it less than ideal as a criterion for optimization. To address this limitation, we introduce a simple penalty expression and reinterpret it as a quadratic unconstrained binary optimization (QUBO) formulation. Ultimately, the resulting QUBO formulation is relaxed into a differentiable advanced torrential (AT) loss function through an approximation process. The proposed AT loss demonstrates its superiority through the Lipschitz constant, forecast performance evaluations, consistency experiments, and ablation studies with the operational model.

cs.LG

HEIR: A Universal Compiler for Homomorphic Encryption

This work presents Homomorphic Encryption Intermediate Representation (HEIR), a unified approach to building homomorphic encryption (HE) compilers. HEIR aims to support all mainstream techniques in homomorphic encryption, integrate with all major software libraries and hardware accelerators, and advance the field by providing a platform for research and benchmarking. Built on the MLIR compiler framework, HEIR introduces HE-specific abstraction layers at which existing optimizations and new research ideas may be easily implemented. Although many HE optimization techniques have been proposed, it remains difficult to combine or compare them effectively. HEIR provides a means to effectively explore the space of HE optimizations. HEIR addresses the entire HE stack and includes support for various frontends, including Python. The contribution of this work includes: (1) We introduce HEIR as a framework for building HE compilers. (2) We validate HEIR's design by porting a large fraction of the HE literature to HEIR, and we argue that HEIR can tackle more complicated and diverse programs than prior literature. (3) We provide evidence that HEIR is emerging as the de facto HE compiler for academic research and industry development.

cs.CR

RRADistill: Distilling LLMs' Passage Ranking Ability for Long-Tail Queries Document Re-Ranking on a Search Engine

Large Language Models (LLMs) excel at understanding the semantic relationships between queries and documents, even with lengthy and complex long-tail queries. These queries are challenging for feedback-based rankings due to sparse user engagement and limited feedback, making LLMs' ranking ability highly valuable. However, the large size and slow inference of LLMs necessitate the development of smaller, more efficient models (sLLMs). Recently, integrating ranking label generation into distillation techniques has become crucial, but existing methods underutilize LLMs' capabilities and are cumbersome. Our research, RRADistill: Re-Ranking Ability Distillation, propose an efficient label generation pipeline and novel sLLM training methods for both encoder and decoder models. We introduce an encoder-based method using a Term Control Layer to capture term matching signals and a decoder-based model with a ranking layer for enhanced understanding. A/B testing on a Korean-based search platform, validates the effectiveness of our approach in improving re-ranking for long-tail queries.

cs.IR

PCT-CycleGAN: Paired Complementary Temporal Cycle-Consistent Adversarial Networks for Radar-Based Precipitation Nowcasting

The precipitation nowcasting methods have been elaborated over the centuries because rain has a crucial impact on human life. Not only quantitative precipitation forecast (QPF) models and convolutional long short-term memory (ConvLSTM), but also various sophisticated methods such as the latest MetNet-2 are emerging. In this paper, we propose a paired complementary temporal cycle-consistent adversarial networks (PCT-CycleGAN) for radar-based precipitation nowcasting, inspired by cycle-consistent adversarial networks (CycleGAN), which shows strong performance in image-to-image translation. PCT-CycleGAN generates temporal causality using two generator networks with forward and backward temporal dynamics in paired complementary cycles. Each generator network learns a huge number of one-to-one mappings about time-dependent radar-based precipitation data to approximate a mapping function representing the temporal dynamics in each direction. To create robust temporal causality between paired complementary cycles, novel connection loss is proposed. And torrential loss to cover exceptional heavy rain events is also proposed. The generator network learning forward temporal dynamics in PCT-CycleGAN generates radar-based precipitation data 10 minutes from the current time. Also, it provides a reliable prediction of up to 2 hours with iterative forecasting. The superiority of PCT-CycleGAN is demonstrated through qualitative and quantitative comparisons with several previous methods.

cs.LG

Kirchhoff's Circuit Law Applications to Graph Simplification in Search Problems

This paper proposes a new analysis of graph using the concept of electric potential, and also proposes a graph simplification method based on this analysis. Suppose that each node in the weighted-graph has its respective potential value. Furthermore, suppose that the start and terminal nodes in graphs have maximum and zero potentials, respectively. When we let the level of each node be defined as the minimum number of edges/hops from the start node to the node, the proper potential of each level can be estimated based on geometric proportionality relationship. Based on the estimated potential for each level, we can re-design the graph for path-finding problems to be the electrical circuits, thus Kirchhoff's Circuit Law can be directed applicable for simplifying the graph for path-finding problems.

cs.DM

A Tutorial on Quantum Convolutional Neural Networks (QCNN)

Convolutional Neural Network (CNN) is a popular model in computer vision and has the advantage of making good use of the correlation information of data. However, CNN is challenging to learn efficiently if the given dimension of data or model becomes too large. Quantum Convolutional Neural Network (QCNN) provides a new solution to a problem to solve with CNN using a quantum computing environment, or a direction to improve the performance of an existing learning model. The first study to be introduced proposes a model to effectively solve the classification problem in quantum physics and chemistry by applying the structure of CNN to the quantum computing environment. The research also proposes the model that can be calculated with O(log(n)) depth using Multi-scale Entanglement Renormalization Ansatz (MERA). The second study introduces a method to improve the model's performance by adding a layer using quantum computing to the CNN learning model used in the existing computer vision. This model can also be used in small quantum computers, and a hybrid learning model can be designed by adding a quantum convolution layer to the CNN model or replacing it with a convolution layer. This paper also verifies whether the QCNN model is capable of efficient learning compared to CNN through training using the MNIST dataset through the TensorFlow Quantum platform.

quant-ph

Quantum Approximation for Wireless Scheduling

This paper proposes a quantum approximate optimization algorithm (QAOA) method for wireless scheduling problems. The QAOA is one of the promising hybrid quantum-classical algorithms for many applications and it provides highly accurate optimization solutions in NP-hard problems. QAOA maps the given problems into Hilbert spaces, and then it generates Hamiltonian for the given objectives and constraints. Then, QAOA finds proper parameters from classical optimization approaches in order to optimize the expectation value of generated Hamiltonian. Based on the parameters, the optimal solution to the given problem can be obtained from the optimum of the expectation value of Hamiltonian. Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS) algorithm is proposed. First of all, this paper formulates a wireless scheduling problem using maximum weight independent set (MWIS). Then, for the given MWIS, the proposed QAOS designs the Hamiltonian of the problem. After that, the iterative QAOS sequence solves the wireless scheduling problem. This paper verifies the novelty of the proposed QAOS via simulations implemented by Cirq and TensorFlow-Quantum.

cs.OH

The Boltzmann distribution and the quantum-classical correspondence

In this paper we explore the following question: can the probabilities constituting the quantum Boltzmann distribution, $P^B_n \propto e^{-E_n/kT}$, be derived from a requirement that the quantum configuration-space distribution for a system in thermal equilibrium be very similar to the corresponding classical distribution? It is certainly to be expected that the quantum distribution in configuration space will approach the classical distribution as the temperature approaches infinity, and a well-known equation derived from the Boltzmann distribution shows that this is generically the case. Here we ask whether one can reason in the opposite direction, that is, from quantum-classical agreement to the Boltzmann probabilities. For two of the simple examples we consider---a particle in a one-dimensional box and a simple harmonic oscillator---this approach leads to probability distributions that provably approach the Boltzmann probabilities at high temperature, in the sense that the Kullback-Leibler divergence between the distributions approaches zero.

quant-ph

On the $L^p$ regularity of solutions to the generalized Hunter-Saxton system

The generalized Hunter-Saxton system comprises several well-known models from fluid dynamics and serves as a tool for the study of fluid convection and stretching in one-dimensional evolution equations. In this work, we examine the global regularity of periodic smooth solutions of this system in $L^p$, $p \in [1,\infty)$, spaces for nonzero real parameters $(λ,κ)$. Our results significantly improve/extend those by Wunsch et al. [27-29] and Sarria [21]. Furthermore, we study the effects that different boundary conditions have on the global regularity of solutions by replacing periodicity with a homogeneous three-point boundary condition and establish finite-time blowup of a local-in-time solution of the resulting system for particular values of the parameters.

math.AP