arXiv subjects

Jinyuan Chen

Publications and source records attributed to Jinyuan Chen.

At least 19 recordsLinked to original sources

arXiv2026

Self-powered InAs nanowire detector arrays for extended-SWIR spectrometry at room temperature

Spectral sensing in the extended shortwave infrared (e-SWIR) is important for molecular analysis, infrared imaging, and machine vision, motivating the development of compact spectrometers for broader applications. However, conventional commercial off-the-shelf spectrometers in this wavelength region are expensive and bulky due to their reliance on external dispersive optics/filters and/or cryogenic accessories. Other emerging computational spectrometers are based on Si and InGaAs photodetectors that remain focused on the visible and near-infrared, with few detector platforms operating in the e-SWIR regime that simultaneously provide broadband sensitivity, low-noise room-temperature operation, and diverse spectral signatures for accurate identification and reconstruction. Here, we report a room-temperature e-SWIR computational spectrometer based on InAs/InP core-shell nanowire photodetector arrays with geometry-encoded spectral responses. The detectors exhibit self-powered broadband photoresponse across the 1--3 $\mu$m range, with responsivity up to 0.215 A W$^{-1}$, detectivity up to $1.6 \times 10^{9}$ cm Hz$^{1/2}$ W$^{-1}$, and microsecond response times. The excellent detector performance is leveraged to demonstrate filter-free spectral reconstruction using a compact multipixel photodetector array device. This enables high-accuracy molecular absorption spectrum reconstruction and hyperspectral imaging. Our results indicate that InAs nanowire arrays are a promising platform for compact computational spectrometry and imaging in the e-SWIR at room temperature.

physics.optics↗

arXiv2026

The Second LoViF 2026 Challenge on Real-World All-in-One Image Restoration: Methods and Results

This paper presents a review of the second LoViF Challenge on Real-World All-in-One Image Restoration. The challenge aims to advance unified image restoration under diverse real-world degradation conditions, including blur, low-light, haze, rain, and snow. It provides a common benchmark for evaluating the restoration accuracy, robustness, and generalization capability of models across multiple degradation categories within a unified framework. The competition attracted 158 registered participants, and 20 teams were included in the final ranking after their submitted results were successfully reproduced and verified. This report provides a comprehensive analysis of the submitted solutions and corresponding results, highlighting recent advances in real-world all-in-one image restoration. The summarized methods and empirical findings reveal effective design strategies and establish an updated benchmark for future research in real-world low-level vision.

cs.CV↗

arXiv2026

Mi-Memory: A Lifecycle Memory Framework for Personal AI

Personal AI is moving beyond chat-only interaction toward continuous services that span phones, cars, homes, wearables, cameras, and tools. In this setting, memory cannot remain a cache of prior conversations. It should serve as a continuity and governance substrate: preserving durable user state, grounding answers in multimodal and device evidence, supporting correction and forgetting, bounding policy evolution, and remaining deployable under latency, cost, privacy, and edge-cloud constraints. This technical report presents Mi-Memory, a lifecycle memory framework for Personal AI organized around four roles: Structure, Expansion, Evolution, and Deployment. A shared audit contract links these roles through four recurring artifact families: typed evidence payloads preserve source identity and provenance, diagnostic traces localize evidence loss across the serving pipeline, strategy artifacts make memory-policy changes explicit, and gate/rollback records bound accepted evolution. MiMemory instantiates the roles through MemStack, MemSense/MemFuse, D$^{2}$ACCI/E$^{2}$MEND, and LiteMem. In controlled-reference Structure evaluations, MemStack reaches 93.59%, 57.24%, and 87.47% on LoCoMo, PersonaMem-V2, and LongMemEval, respectively; other tracks report module-level, preliminary/internal, transfer-feasibility, or design-only evidence with explicit boundaries. MiMemory is a step toward auditable, evidence-gated, and deployment-aware memory systems for Personal AI. Project homepage: https://darwin-agent.github.io/Mi-Memory/ .

cs.AI↗

arXiv2026

Hyperdoped silicon photodetectors enable room-temperature computational SWIR imaging at 1550 nm

Silicon's bandgap inherently restricts its photodetection to wavelengths below 1100 nm, necessitating the integration of costly III-V semiconductors for short-wave infrared applications. Hyperdoping silicon beyond the solid solubility limit offers a promising "silicon-native" alternative, yet achieving practical short-wave infrared applications at room temperature remains a formidable challenge. Here, we demonstrate a high-detectivity hyperdoped silicon photodetector enabling room-temperature computational short-wave infrared imaging beyond Si bandgap wavelength at {\lambda} = 1550 nm. By integrating an ultrafast laser heating process step to reduce the dark current while keeping high responsivity, we achieve a specific detectivity D^* exceeding 10^9 Jones for 1550 nm at room temperature working in a forward-biased, photoconductive mode. The improved detectivity, coupled with a 59.4 dB linear dynamic range and kHz-scale bandwidth, allows us to demonstrate a single-pixel imaging system that reconstructs 1550 nm scenes at 65x63 pixels without cryogenic cooling. Our devices simultaneously support visible-light imaging, offering a path toward monolithically integrated, multispectral Si-native optical sensors. These results establish ultrafast-laser hyperdoped silicon as a viable platform for low-cost, room-temperature, short-wave infrared photonics, bridging the gap between advanced materials science and practical computational imaging system.

physics.optics↗

arXiv2025

OSGym: Scalable OS Infra for Computer Use Agents

Training computer use agents requires full-featured OS sandboxes with GUI environments, which consume substantial hardware resources as the number of sandboxes scales. Stochastic errors arising from diverse software execution within these sandboxes further demand robust infrastructure design and reliable error recovery. We present OSGym, a scalable OS environment infrastructure for computer use agents, built around these key optimization strategies: (1) Decentralized OS state management, which isolates failures to individual replicas and significantly enhances overall system reliability; (2) Hardware-aware OS replica orchestration, which addresses CPU-bounded scaling bottlenecks and substantially reduces compute overhead; (3) KVM virtualization with copy-on-write disk management, which shares a common bootable disk across VM instances and provisions only instance-specific modifications, reducing physical disk consumption by 88% and increasing disk provisioning speed by 37 times; and (4) Robust container pool with multi-layer fault recovery. Together, these optimizations yield strong scalability and resource efficiency: OSGym manages over a thousand OS replicas under constrained resources, supports parallel trajectory generation at 1420 multi-turn trajectories per minute, and reduces per-replica cost to 0.2-0.3 USD per day, a 90% reduction over standard deployment. Our experiments validate OSGym across end-to-end pipelines for data collection and training for computer use agents. We believe OSGym establishes a new foundation for scalable, general-purpose computer use agent research.

cs.DC↗

arXiv2025

COOL Is Optimal in Error-Free Asynchronous Byzantine Agreement

COOL (Chen'21) is an error-free, information-theoretically secure Byzantine agreement (BA) protocol proven to achieve BA consensus in the synchronous setting for an $\ell$-bit message, with a total communication complexity of $O(\max\{n\ell, nt \log q\})$ bits, four communication rounds in the worst case, and a single invocation of a binary BA, under the optimal resilience assumption $n \geq 3t + 1$ in a network of $n$ nodes, where up to $t$ nodes may behave dishonestly. Here, $q$ denotes the alphabet size of the error correction code used in the protocol. In this work, we present an adaptive variant of COOL, called OciorACOOL, which achieves error-free, information-theoretically secure BA consensus in the asynchronous setting with total $O(\max\{n\ell, n t \log q\})$ communication bits, $O(1)$ rounds, and a single invocation of an asynchronous binary BA protocol, still under the optimal resilience assumption $n \geq 3t + 1$. Moreover, OciorACOOL retains the same low-complexity, traditional $(n, k)$ error-correction encoding and decoding as COOL, with $k=t/3$.

cs.DC↗

arXiv2025

High Pixel Resolution Visible to Extended Shortwave Infrared Single Pixel Imaging with a black Phosphorus-Molybdenum disulfide (bP-MoS2) photodiode

High-resolution infrared imagers are currently more expensive than CMOS and CCD cameras, due to costly sensor arrays. Van der Waals (vdWs) materials present an opportunity for low-cost, room temperature infrared photodetectors. Although photodetectors based on vdWs materials show promising performance, creating a megapixel array is yet to be achieved. Imaging with a single vdWs photodetector typically relies on time-consuming mechanical scanning and suffers from low resolution. Single pixel imaging (SPI) offers an affordable alternative to achieve high-resolution imaging, utilizing only one photodetector and a spatial light modulator. Progress in SPI using vdWs material photodetectors has been limited, with only one prior demonstration in the near infrared range (64$\times$64 pixels). In this work, we demonstrate a high-resolution SPI system (1023$\times$768 for visible light and 512$\times$512 for extended shortwave infrared) using a black phosphorus-molybdenum disulfide (bP-MoS$_2$) photodiode, surpassing earlier vdWs material SPI implementations by a factor of 64 in pixel count. We introduce an easy-to-implement edge detection method for rapid feature extraction. We employ compressed sampling and reduce imaging time by a factor of four. Our compressed sampling approach is based on a cyclic S-matrix, which is derived from a Hadamard-based sequence, where each row is a circular shift of the first row. This enables efficient imaging reconstruction via circular convolution and Fourier transforms, allowing fewer measurements while preserving the key image features. Our method for SPI using a vdWs material photodetector presents the opportunity for inexpensive shortwave infrared and midwave infrared cameras, and thus may enable advances in gas detection, biomedical imaging, autonomous driving, security, and surveillance.

eess.IV↗

arXiv2025

Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security

In this work, we propose Ocior, a practical asynchronous Byzantine fault-tolerant (BFT) consensus protocol that achieves the optimal performance in resilience, communication, computation, and round complexity. Unlike traditional BFT consensus protocols, Ocior processes incoming transactions individually and concurrently using parallel instances of consensus. While leader-based consensus protocols rely on a designated leader to propose transactions, Ocior is a leaderless consensus protocol that guarantees stable liveness. Ocior achieves: 1) Optimal resilience: Ocior tolerates up to $t$ faulty nodes controlled by an adaptive adversary, for $n\geq 3t+1$. 2) Optimal communication complexity: The total expected communication per transaction is $O(n)$. 3) Optimal (or near-optimal) computation complexity: The total computation per transaction is $O(n)$ in the best case, or $O(n \log^2 n)$ in the worst case. 4) Optimal round complexity: A legitimate two-party transaction can be finalized with a good-case latency of two asynchronous rounds, for any $n\geq 3t+1$. The good case in terms of latency refers to the scenario where the transaction is proposed by any (not necessarily designated) honest node. A two-party transaction involves the transfer of digital assets from one user (or group of users) to one or more recipients. To support efficient consensus, we introduce a novel non-interactive threshold signature (TS) scheme called OciorBLSts. It offers fast signature aggregation, and is adaptively secure. OciorBLSts achieves a computation complexity of signature aggregation of only $O(n)$ in the good cases. Moreover, OciorBLSts supports the property of Instantaneous TS Aggregation. This enables real-time aggregation of partial signatures as they arrive, reducing waiting time and improving responsiveness.

cs.DC↗

arXiv2025

Kairos: Low-latency Multi-Agent Serving with Shared LLMs and Excessive Loads in the Public Cloud

Multi-agent applications utilize the advanced capabilities of large language models (LLMs) for intricate task completion through agent collaboration in a workflow. Under this situation, requests from different agents usually access the same shared LLM to perform different kinds of tasks, forcing the shared LLM to suffer excessive loads. However, existing works have low serving performance for these multi-agent applications, mainly due to the ignorance of inter-agent latency and resource differences for request scheduling. We therefore propose Kairos, a multi-agent orchestration system that optimizes end-to-end latency for multi-agent applications. Kairos consists of a workflow orchestrator, a workflow-aware priority scheduler, and a memory-aware dispatcher. The orchestrator collects agent-specific information for online workflow analysis. The scheduler decides the serving priority of the requests based on their latency characteristics to reduce the overall queuing. The dispatcher dispatches the requests to different LLM instances based on their memory demands to avoid GPU overloading. Experimental results show that Kairos reduces end-to-end latency by 17.8% to 28.4% compared to state-of-the-art works.

cs.DC↗

arXiv2025

OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement

In this work, we propose an error-free, information-theoretically secure multi-valued asynchronous Byzantine agreement (ABA) protocol, called OciorABA. This protocol achieves ABA consensus on an $\ell$-bit message with an expected communication complexity of $O(n\ell + n^3 \log q )$ bits and an expected round complexity of $O(1)$ rounds, under the optimal resilience condition $n \geq 3t + 1$ in an $n$-node network, where up to $t$ nodes may be dishonest. Here, $q$ denotes the alphabet size of the error correction code used in the protocol. In our protocol design, we introduce a new primitive: asynchronous partial vector agreement (APVA). In APVA, the distributed nodes input their vectors and aim to output a common vector, where some of the elements of those vectors may be missing or unknown. We propose an APVA protocol with an expected communication complexity of $O( n^3 \log q )$ bits and an expected round complexity of $O(1)$ rounds. This APVA protocol serves as a key building block for our OciorABA protocol.

cs.DC↗

arXiv2024

OciorMVBA: Near-Optimal Error-Free Asynchronous MVBA

In this work, we propose an error-free, information-theoretically secure, asynchronous multi-valued validated Byzantine agreement (MVBA) protocol, called OciorMVBA. This protocol achieves MVBA consensus on a message $\boldsymbol{w}$ with expected $O(n |\boldsymbol{w}|\log n + n^2 \log q)$ communication bits, expected $O(n^2)$ messages, expected $O(\log n)$ rounds, and expected $O(\log n)$ common coins, under optimal resilience $n \geq 3t + 1$ in an $n$-node network, where up to $t$ nodes may be dishonest. Here, $q$ denotes the alphabet size of the error correction code used in the protocol. When error correction codes with a constant alphabet size (e.g., Expander Codes) are used, $q$ becomes a constant. An MVBA protocol that guarantees all required properties without relying on any cryptographic assumptions, such as signatures or hashing, except for the common coin assumption, is said to be information-theoretically secure (IT secure). Under the common coin assumption, an MVBA protocol that guarantees all required properties in all executions is said to be error-free. We also propose another error-free, IT-secure, asynchronous MVBA protocol, called OciorMVBArr. This protocol achieves MVBA consensus with expected $O(n |\boldsymbol{w}| + n^2 \log n)$ communication bits, expected $O(1)$ rounds, and expected $O(1)$ common coins, under a relaxed resilience (RR) of $n \geq 5t + 1$. Additionally, we propose a hash-based asynchronous MVBA protocol, called OciorMVBAh. This protocol achieves MVBA consensus with expected $O(n |\boldsymbol{w}| + n^3)$ bits, expected $O(1)$ rounds, and expected $O(1)$ common coins, under optimal resilience $n \geq 3t + 1$.

cs.CR↗

arXiv2024

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast

COOL (Chen'21) is an error-free and deterministic Byzantine agreement protocol that achieves consensus on an $\ell$-bit message with a communication complexity of $O(\max\{n\ell, n t \log t \})$ bits in four phases, given $n\geq 3t + 1$, for a network of $n$ nodes, where up to $t$ nodes may be dishonest. In this work we show that COOL can be optimized by reducing one communication round. The new protocol is called OciorCOOL. Additionally, building on OciorCOOL, we design an optimal reliable broadcast protocol that requires only six communication rounds.

cs.DC↗

arXiv2023

A Survey of Blockchain, Artificial Intelligence, and Edge Computing for Web 3.0

Web 3.0, as the third generation of the World Wide Web, aims to solve contemporary problems of trust, centralization, and data ownership. Driven by the latest advances in cutting-edge technologies, Web 3.0 is moving towards a more open, decentralized, intelligent, and interconnected network. However, increasingly widespread data breaches have raised awareness of online privacy and security of personal data. Additionally, since Web 3.0 is a sophisticated and complex convergence, the technical details behind it are not as clear as the characteristics it presents. In this survey, we conduct an in-depth exploration of Web 3.0 from the perspectives of blockchain, artificial intelligence, and edge computing. Specifically, we begin with summarizing the evolution of the Internet and providing an overview of these three key technological factors. Afterward, we provide a thorough analysis of each technology separately, including its relevance to Web 3.0, key technology components, and practical applications. We also propose decentralized storage and computing solutions by exploring the integration of technologies. Finally, we highlight the key challenges alongside potential research directions. Through the combination and mutual complementation of multiple technologies, Web 3.0 is expected to return more control and ownership of data and digital assets back to users.

cs.CR↗

arXiv2020

Fundamental Limits of Byzantine Agreement

Byzantine agreement (BA) is a distributed consensus problem where $n$ processors want to reach agreement on an $\ell$-bit message or value, but up to $t$ of the processors are dishonest or faulty. The challenge of this BA problem lies in achieving agreement despite the presence of dishonest processors who may arbitrarily deviate from the designed protocol. The quality of a BA protocol is measured primarily by using the following three parameters: the number of processors $n$ as a function of $t$ allowed (resilience); the number of rounds (round complexity, denoted by $r$); and the total number of communication bits (communication complexity, denoted by $b$). For any error-free BA protocol, the known lower bounds on those three parameters are $n\geq 3t+1$, $r\geq t+1$ and $b\geqΩ(\max\{n\ell, nt\})$, respectively, where a protocol that is guaranteed to be correct in all executions is said to be error free. In this work by using coding theory, together with graph theory and linear algebra, we design a coded BA protocol (termed as COOL) that achieves consensus on an $\ell$-bit message with optimal resilience, asymptotically optimal round complexity, and asymptotically optimal communication complexity when $\ell \geq t\log t$, simultaneously. The proposed COOL is an error-free and deterministic BA protocol that does not rely on cryptographic technique. It is secure against computationally unbounded adversary. With the achievable performance by the proposed COOL and the known lower bounds, we characterize the optimal communication complexity exponent as \[β^*(α,δ)=\max\{1+α,1+δ\}\] for $β= \lim_{n\to\infty}\log b/\log n$, $α=\lim_{n \to \infty} \log \ell/\log n$ and $δ=\lim_{n\to\infty} \log t/\log n$. This work reveals that coding is an effective approach for achieving the fundamental limits of Byzantine agreement and its variants.

cs.IT↗

arXiv2019

Multi-layer Interference Alignment and GDoF of the K-User Asymmetric Interference Channel

In wireless networks, link strengths are often affected by some topological factors such as propagation path loss, shadowing and inter-cell interference. Thus, different users in the network might experience different link strengths. In this work we consider a K-user asymmetric interference channel, where the channel gains of the links connected to Receiver k are scaled with P^{α_k /2}}, k=1,2,...,K, for 0< α_1 \leq α_2 \leq \cdots \leq α_K \leq 1. For this setting, we show that the optimal sum generalized degrees-of-freedom (GDoF) is characterized as dsum = (\sum_{k=1}^K α_k + α_K -α_{K-1})/2, which matches the existing result dsum= K/2 when α_1 = α_2 = ... = α_K =1. The achievability is based on multi-layer interference alignment, where different interference alignment sub-schemes are designed in different layers associated with specific power levels, and successive decoding is applied at the receivers. While the converse for the symmetric case only requires bounding the sum degrees-of-freedom (DoF) for selected two users, the converse for this asymmetric case involves bounding the weighted sum GDoF for selected J+2 users, with corresponding weights (2^{J}, 2^{J-1}, ... , 2^{2}, 2^{1}), a geometric sequence with common ratio 2, for the first J users and with corresponding weights (1, 1) for the last two users, for J \in {1,2, ... , \lceil\log (K/2)\rceil }.

cs.IT↗

arXiv2019

Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper

We study a symmetric Gaussian wiretap channel with a helper, where a confidential message is sent from a transmitter to a legitimate receiver, in the presence of a helper and an eavesdropper, under a weak notion of secrecy constraint. For this setting, we characterize the optimal secure generalized degrees-of-freedom (GDoF). The result reveals that, adding a helper can significantly increase the secure GDoF of the wiretap channel. The result is supported by a new converse and a new scheme. In the proposed scheme, the helper sends a cooperative jamming signal at a specific power level and direction. In this way, it minimizes the penalty in GDoF incurred by the secrecy constraint. In the secure rate analysis, the techniques of noise removal and signal separation are used.

cs.IT↗

arXiv2019

Distributed Computing with Heterogeneous Communication Constraints: The Worst-Case Computation Load and Proof by Contradiction

We consider a distributed computing framework where the distributed nodes have different communication capabilities, motivated by the heterogeneous networks in data centers and mobile edge computing systems. Following the structure of MapReduce, this framework consists of Map computation phase, Shuffle phase, and Reduce computation phase. The Shuffle phase allows distributed nodes to exchange intermediate values, in the presence of heterogeneous communication bottlenecks for different nodes (heterogeneous communication load constraints). For this setting, we characterize the minimum total computation load and the minimum worst-case computation load in some cases, under the heterogeneous communication load constraints. While the total computation load depends on the sum of the computation loads of all the nodes, the worst-case computation load depends on the computation load of a node with the heaviest job. We show an interesting insight that, for some cases, there is a tradeoff between the minimum total computation load and the minimum worst-case computation load, in the sense that both cannot be achieved at the same time. The achievability schemes are proposed with careful design on the file assignment and the data shuffling. Beyond the cut-set bound, a novel converse is proposed using the proof by contradiction. For the general case, we identify two extreme regimes in which both the scheme with coding and the scheme without coding are optimal, respectively.

cs.IT↗

arXiv2019

Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

In communication networks secrecy constraints usually incur an extra limit in capacity or generalized degrees-of-freedom (GDoF), in the sense that a penalty in capacity or GDoF is incurred due to the secrecy constraints. Over the past decades a significant amount of effort has been made by the researchers to understand the limits of secrecy constraints in communication networks. In this work, we focus on how to remove the secrecy constraints in communication networks, i.e., how to remove the GDoF penalty due to secrecy constraints. We begin with three basic settings: a two-user symmetric Gaussian interference channel with confidential messages, a symmetric Gaussian wiretap channel with a helper, and a two-user symmetric Gaussian multiple access wiretap channel. Interestingly, in this work we show that adding common randomness at the transmitters can totally remove the penalty in GDoF or GDoF region of the three settings considered here. The results reveal that adding common randomness at the transmitters is a powerful way to remove the secrecy constraints in communication networks in terms of GDoF performance. Common randomness can be generated offline. The role of the common randomness is to jam the information signal at the eavesdroppers, without causing too much interference at the legitimate receivers. To accomplish this role, a new method of Markov chain-based interference neutralization is proposed in the achievability schemes utilizing common randomness. From the practical point of view, we hope to use less common randomness to remove secrecy constraints in terms of GDoF performance. With this motivation, for most of the cases we characterize the minimal GDoF of common randomness to remove secrecy constraints, based on our derived converses and achievability.

cs.IT↗