arXiv subjects

Jeongbin Kim

Publications and source records attributed to Jeongbin Kim.

7 recordsLinked to original sources

arXiv2026

Do People Follow AI Advice? Evidence from a Pension Portfolio Choice Experiment

We study how differences in AI-generated financial recommendations are transmitted into individual portfolio choices. In an experiment with 400 employed adults enrolled in workplace defined contribution pension plans in South Korea, participants allocate a hypothetical pension balance across eleven products and may revise it after receiving one of two fixed AI-generated recommendations. A $2 \times 2$ design randomizes recommendation content and whether the recommendation includes a short rationale. Approximately 37$\%$ of the experimentally induced difference between the aggressive and conservative recommendations passes through to final portfolios. This causal contrast changes expected portfolio return, volatility, allocations across risk grades, and the number of products held, but produces no detectable difference in computed Sharpe ratios. 81$\%$ of participants revise. Among revisers, 95$\%$ move toward the assigned recommendation and implement about half of the suggested adjustment. Rationales do not detectably alter pass-through. These results show that users partially and selectively transmit recommendation content into economically meaningful differences in risk exposure while retaining substantial weight on their initial choices.

econ.GN↗

arXiv2026

Cooperative Multi-Satellite ISAC Networks: Centralized vs. Distributed Sensing

This paper investigates a downlink multi-satellite integrated sensing and communication (ISAC) network, in which multiple satellites simultaneously transmit ISAC signals to provide communication services to ground user equipments and enable cooperative sensing of airborne targets through multiple gateways. To support this dual functionality, we introduce communication and sensing beamforming designs based on uniform planar arrays with optimized power allocation. Building on these designs, we propose two cooperative sensing frameworks, namely centralized and distributed. In the centralized framework, each gateway forwards its sensing observations to a central unit (CU), where the positions of multiple targets are jointly estimated from the aggregated data. To mitigate the signaling overhead inherent in centralized processing, a distributed framework is further proposed, in which each gateway independently estimates target positions and transmits only the local estimates to the CU. To associate estimates from different gateways, a data association problem based on the squared Euclidean distance is formulated and efficiently solved using the Hungarian algorithm. The final target positions are then obtained by minimizing the distance error. Simulation results demonstrate that the proposed centralized and distributed frameworks significantly outperform existing sensing schemes while satisfying communication performance requirements. Finally, we evaluate the sensing-communication trade-off from the viewpoints of sensing accuracy and communication power consumption under the proposed frameworks.

eess.SP↗

arXiv2024

IANUS: Integrated Accelerator based on NPU-PIM Unified Memory System

Accelerating end-to-end inference of transformer-based large language models (LLMs) is a critical component of AI services in datacenters. However, diverse compute characteristics of end-to-end LLM inference present challenges as previously proposed accelerators only address certain operations or stages (e.g., self-attention, generation stage, etc.). To address the unique challenges of accelerating end-to-end inference, we propose IANUS -- Integrated Accelerator based on NPU-PIM Unified Memory System. IANUS is a domain-specific system architecture that combines a Neural Processing Unit (NPU) with a Processing-in-Memory (PIM) to leverage both the NPU's high computation throughput and the PIM's high effective memory bandwidth. In particular, IANUS employs a unified main memory system where the PIM memory is used both for PIM operations and for NPU's main memory. The unified main memory system ensures that memory capacity is efficiently utilized and the movement of shared data between NPU and PIM is minimized. However, it introduces new challenges since normal memory accesses and PIM computations cannot be performed simultaneously. Thus, we propose novel PIM Access Scheduling that manages normal memory accesses and PIM computations through workload mapping and scheduling across the PIM and the NPU. Our detailed simulation evaluations show that IANUS improves the performance of GPT-2 by 6.2$\times$ and 3.2$\times$, on average, compared to the NVIDIA A100 GPU and the state-of-the-art accelerator. As a proof-of-concept, we develop a prototype of IANUS with a commercial PIM, NPU, and an FPGA-based PIM controller to demonstrate the feasibility of IANUS.

cs.AR↗

arXiv2024

Can an LLM Learn Preferences from Choice Data?

Can large language models (LLMs) learn a decision maker's preferences from observed choices and generate preference-consistent recommendations in new situations? We propose a portable Simulate-Recommend-Evaluate framework that tests preference learning from revealed-choice data by comparing LLM recommendations with optimal choices implied by known preference primitives. We apply the framework to choice under uncertainty using the disappointment aversion model. Recommendation accuracy improves as models observe more choices, but learning is heterogeneous across preference types and LLMs: GPT learns risk aversion better than disappointment aversion, Gemini performs best in high disappointment-aversion regions, and Claude shows the broadest effective learning across parameter regions.

econ.GN↗

arXiv2023

Rate-splitting Multiple Access for Hierarchical HAP-LAP Networks under Limited Fronthaul

In this correspondence, we propose hierarchical high-altitude platform (HAP)-low-altitude platform (LAP) networks with the aim of maximizing the sum-rate of ground user equipments (UEs). The multiple aerial radio units (RUs) mounted on HAPs and LAPs are managed by the central unit (CU) via constrained fronthaul links. The limitation of fronthaul capacity can be addressed through quantization, employing the cloud radio access network (C-RAN) architecture. For spectral efficiency, we adopt the rate-splitting multiple access (RSMA), leveraging the advantages of both space-division multiple access (SDMA) and non-orthogonal multiple access (NOMA). To achieve this, we jointly optimize rate splitting, transmit power allocation, quantization noise variance, and UAV placement using an alternating optimization (AO) approach coupled with successive convex approximation (SCA) and the weighted minimum mean square error (WMMSE) method. Numerical results validate the superior performance of the proposed method compared to benchmark schemes, including partial optimizations or those without the assistance of LAPs.

eess.SY↗

arXiv2023

Cache-assisted Mobile Edge Computing over Space-Air-Ground Integrated Networks for Extended Reality Applications

Extended reality-enabled Internet of Things (XRI) provides the new user experience and the sense of immersion by adding virtual elements to the real world through Internet of Things (IoT) devices and emerging 6G technologies. However, the computational-intensive XRI tasks are challenging for the energy-constrained small-size XRI devices to cope with, and moreover certain data requires centralized computing that needs to be shared among users. To this end, we propose a cache-assisted space-air-ground integrated network mobile edge computing (SAGIN-MEC) system for XRI applications, consisting of two types of edge servers mounted on an unmanned aerial vehicle (UAV) and low Earth orbit (LEO) equipped with cache and the multiple ground XRI devices. For system efficiency, the four different offloading procedures of the XRI data are considered according to the type of information, i.e., shared data and private data, as well as the offloading decision and the caching status. Specifically, the private data can be offloaded to either UAV or LEO, while the offloading decision of the shared data to the LEO can be determined by the caching status. With the aim of maximizing the energy efficiency of the overall system, we jointly optimize UAV trajectory, resource allocation and offloading decisions under latency constraints and UAV's operational limitations by using the alternating optimization (AO)-based method along with Dinkelbach algorithm and successive convex optimization (SCA). Via numerical results, the proposed algorithm is verified to have the superior performance compared to conventional partial optimizations or without cache.

eess.SP↗

arXiv2022

Random Utility and Limited Consideration

The random utility model (RUM, McFadden and Richter, 1990) has been the standard tool to describe the behavior of a population of decision makers. RUM assumes that decision makers behave as if they maximize a rational preference over a choice set. This assumption may fail when consideration of all alternatives is costly. We provide a theoretical and statistical framework that unifies well-known models of random (limited) consideration and generalizes them to allow for preference heterogeneity. We apply this methodology in a novel stochastic choice dataset that we collected in a large-scale online experiment. Our dataset is unique since it exhibits both choice set and (attention) frame variation. We run a statistical survival race between competing models of random consideration and RUM. We find that RUM cannot explain the population behavior. In contrast, we cannot reject the hypothesis that decision makers behave according to the logit attention model (Brade and Rehbeck, 2016).

econ.GN↗