Searcharxiv⌕ Search

arXiv subjects

Xin Cai

Publications and source records attributed to Xin Cai.

At least 37 records · Page 2Linked to original sources

One Framework to Rule Them All: Unifying RL-Based and RL-Free Methods in RLHF

In this article, we primarily examine a variety of RL-based and RL-free methods designed to address Reinforcement Learning from Human Feedback (RLHF) and Large Reasoning Models (LRMs). We begin with a concise overview of the typical steps involved in RLHF and LRMs. Next, we reinterpret several RL-based and RL-free algorithms through the perspective of neural structured bandit prediction, providing a clear conceptual framework that uncovers a deeper connection between these seemingly distinct approaches. Following this, we briefly review some core principles of reinforcement learning, drawing attention to an often-overlooked aspect in existing RLHF studies. This leads to a detailed derivation of the standard RLHF objective within a full RL context, demonstrating its equivalence to neural structured bandit prediction. Finally, by reinvestigating the principles behind Proximal Policy Optimization (PPO), we pinpoint areas needing adjustment, which culminates in the introduction of the Generalized Reinforce Optimization (GRO) framework, seamlessly integrating RL-based and RL-free methods in RLHF. We look forward to the community's efforts to empirically validate GRO and invite constructive feedback.

cs.LG↗

PhoCoLens: Photorealistic and Consistent Reconstruction in Lensless Imaging

Lensless cameras offer significant advantages in size, weight, and cost compared to traditional lens-based systems. Without a focusing lens, lensless cameras rely on computational algorithms to recover the scenes from multiplexed measurements. However, current algorithms struggle with inaccurate forward imaging models and insufficient priors to reconstruct high-quality images. To overcome these limitations, we introduce a novel two-stage approach for consistent and photorealistic lensless image reconstruction. The first stage of our approach ensures data consistency by focusing on accurately reconstructing the low-frequency content with a spatially varying deconvolution method that adjusts to changes in the Point Spread Function (PSF) across the camera's field of view. The second stage enhances photorealism by incorporating a generative prior from pre-trained diffusion models. By conditioning on the low-frequency content retrieved in the first stage, the diffusion model effectively reconstructs the high-frequency details that are typically lost in the lensless imaging process, while also maintaining image fidelity. Our method achieves a superior balance between data fidelity and visual quality compared to existing methods, as demonstrated with two popular lensless systems, PhlatCam and DiffuserCam. Project website: https://phocolens.github.io/.

eess.IV↗

LenslessFace: An End-to-End Optimized Lensless System for Privacy-Preserving Face Verification

Lensless cameras, innovatively replacing traditional lenses for ultra-thin, flat optics, encode light directly onto sensors, producing images that are not immediately recognizable. This compact, lightweight, and cost-effective imaging solution offers inherent privacy advantages, making it attractive for privacy-sensitive applications like face verification. Typical lensless face verification adopts a two-stage process of reconstruction followed by verification, incurring privacy risks from reconstructed faces and high computational costs. This paper presents an end-to-end optimization approach for privacy-preserving face verification directly on encoded lensless captures, ensuring that the entire software pipeline remains encoded with no visible faces as intermediate results. To achieve this, we propose several techniques to address unique challenges from the lensless setup which precludes traditional face detection and alignment. Specifically, we propose a face center alignment scheme, an augmentation curriculum to build robustness against variations, and a knowledge distillation method to smooth optimization and enhance performance. Evaluations under both simulation and real environment demonstrate our method outperforms two-stage lensless verification while enhancing privacy and efficiency. Project website: \url{lenslessface.github.io}.

cs.CV↗

Simulation-based transition density approximation for the inference of SDE models

Stochastic Differential Equations (SDEs) serve as a powerful modeling tool in various scientific domains, including systems science, engineering, and ecological science. While the specific form of SDEs is typically known for a given problem, certain model parameters remain unknown. Efficiently inferring these unknown parameters based on observations of the state in discrete time series represents a vital practical subject. The challenge arises in nonlinear SDEs, where maximum likelihood estimation of parameters is generally unfeasible due to the absence of closed-form expressions for transition and stationary probability density functions of the states. In response to this limitation, we propose a novel two-step parameter inference mechanism. This approach involves a global-search phase followed by a local-refining procedure. The global-search phase is dedicated to identifying the domain of high-value likelihood functions, while the local-refining procedure is specifically designed to enhance the surrogate likelihood within this localized domain. Additionally, we present two simulation-based approximations for the transition density, aiming to efficiently or accurately approximate the likelihood function. Numerical examples illustrate the efficacy of our proposed methodology in achieving posterior parameter estimation.

stat.ME↗

Distributed event-triggered aggregative optimization with applications to price-based energy management

This paper studies a distributed continuous-time aggregative optimization problem, which is a fundamental problem in the price-based energy management. The objective of the distributed aggregative optimization is to minimize the sum of local objective functions, which have a specific expression that relies on agents' own decisions and the aggregation of all agents' decisions. To solve the problem, a novel distributed continuous-time algorithm is proposed by combining gradient dynamics with a dynamic average consensus estimator in a two-time scale. The exponential convergence of the proposed algorithm is established under the assumption of a convex global cost function by virtue of the stability theory of singular perturbation systems. Motivated by practical applications, the implementation of the continuous-time algorithm with event-triggered communication is investigated. Simulations on the price-based energy management of distributed energy resources are given to illustrate the proposed method.

math.OC↗

Revisiting the Encoding of Satellite Image Time Series

Satellite Image Time Series (SITS) representation learning is complex due to high spatiotemporal resolutions, irregular acquisition times, and intricate spatiotemporal interactions. These challenges result in specialized neural network architectures tailored for SITS analysis. The field has witnessed promising results achieved by pioneering researchers, but transferring the latest advances or established paradigms from Computer Vision (CV) to SITS is still highly challenging due to the existing suboptimal representation learning framework. In this paper, we develop a novel perspective of SITS processing as a direct set prediction problem, inspired by the recent trend in adopting query-based transformer decoders to streamline the object detection or image segmentation pipeline. We further propose to decompose the representation learning process of SITS into three explicit steps: collect-update-distribute, which is computationally efficient and suits for irregularly-sampled and asynchronous temporal satellite observations. Facilitated by the unique reformulation, our proposed temporal learning backbone of SITS, initially pre-trained on the resource efficient pixel-set format and then fine-tuned on the downstream dense prediction tasks, has attained new state-of-the-art (SOTA) results on the PASTIS benchmark dataset. Specifically, the clear separation between temporal and spatial components in the semantic/panoptic segmentation pipeline of SITS makes us leverage the latest advances in CV, such as the universal image segmentation architecture, resulting in a noticeable 2.5 points increase in mIoU and 8.8 points increase in PQ, respectively, compared to the best scores reported so far.

cs.CV↗

PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba

Cloud-native databases have become the de-facto choice for mission-critical applications on the cloud due to the need for high availability, resource elasticity, and cost efficiency. Meanwhile, driven by the increasing connectivity between data generation and analysis, users prefer a single database to efficiently process both OLTP and OLAP workloads, which enhances data freshness and reduces the complexity of data synchronization and the overall business cost. In this paper, we summarize five crucial design goals for a cloud-native HTAP database based on our experience and customers' feedback, i.e., transparency, competitive OLAP performance, minimal perturbation on OLTP workloads, high data freshness, and excellent resource elasticity. As our solution to realize these goals, we present PolarDB-IMCI, a cloud-native HTAP database system designed and deployed at Alibaba Cloud. Our evaluation results show that PolarDB-IMCI is able to handle HTAP efficiently on both experimental and production workloads; notably, it speeds up analytical queries up to $\times149$ on TPC-H (100 $GB$). PolarDB-IMCI introduces low visibility delay and little performance perturbation on OLTP workloads (< 5%), and resource elasticity can be achieved by scaling out in tens of seconds.

cs.DB↗

Distributed continuous-time strategy-updating rules for noncooperative games with discrete-time communication

In this paper, continuous-time noncooperative games in networks of double-integrator agents are explored. The existing methods require that agents communicate with their neighbors in real time. In this paper, we propose two discrete-time communication schemes based on the designed continuous-time strategy-updating rule for the efficient use of communication resources. First, the property of the designed continuous-time rule is analyzed to ensure that all agents' strategies can converge to the Nash equilibrium. Then, we propose periodic and event-triggered communication schemes for the implementation of the designed rule with discrete-time communication. The rule in the periodic case is implemented synchronously and easily. The rule in the event-triggered case is executed asynchronously without Zeno behaviors. All agents in both cases can asymptotically reach to the Nash equilibrium by interacting with neighbors at discrete times. Simulations are performed in networks of Cournot competition to illustrate the effectiveness of the proposed methods.

math.OC↗

Resilient distributed resource allocation algorithm under false data injection attacks

A resilient distributed algorithm is proposed to solve the distributed resource allocation problem of a first-order nonlinear multi-agent system who is subject to false data injection (FDI) attacks. An intelligent attacker injects false data into agents' actuators and sensors such that agents execute the algorithm according to the compromised control inputs and interactive information. The goal of the attacker is to make the multi-agent system to be unstable and to cause the deviance of agents' decisions from the optimal resource allocation. At first, we analyze the robustness of a distributed resource allocation algorithm under FDI attacks. Then, the unknown nonlinear term and the false data injected in agents are considered as extended states which can be estimated by extended state observers. The estimation was used in the feedback control to suppress the effect of the FDI attacks. A resilient distributed resource allocation algorithm based on the extended state observer is proposed to ensure that it can converge to the optimal allocation without requiring any information about the nature of the attacker. An example is given to illustrate the results.

math.OC↗

Tampered VAE for Improved Satellite Image Time Series Classification

The unprecedented availability of spatial and temporal high-resolution satellite image time series (SITS) for crop type mapping is believed to necessitate deep learning architectures to accommodate challenges arising from both dimensions. Recent state-of-the-art deep learning models have shown promising results by stacking spatial and temporal encoders. However, we present a Pyramid Time-Series Transformer (PTST) that operates solely on the temporal dimension, i.e., neglecting the spatial dimension, can produce superior results with a drastic reduction in GPU memory consumption and easy extensibility. Furthermore, we augment it to perform semi-supervised learning by proposing a classification-friendly VAE framework that introduces clustering mechanisms into latent space and can promote linear separability therein. Consequently, a few principal axes of the latent space can explain the majority of variance in raw data. Meanwhile, the VAE framework with proposed tweaks can maintain competitive classification performance as its purely discriminative counterpart when only $40\%$ of labelled data is used. We hope the proposed framework can serve as a baseline for crop classification with SITS for its modularity and simplicity.

cs.CV↗

AlphaFold Accelerates Artificial Intelligence Powered Drug Discovery: Efficient Discovery of a Novel Cyclin-dependent Kinase 20 (CDK20) Small Molecule Inhibitor

The AlphaFold computer program predicted protein structures for the whole human genome, which has been considered as a remarkable breakthrough both in artificial intelligence (AI) application and structural biology. Despite the varying confidence level, these predicted structures still could significantly contribute to structure-based drug design of novel targets, especially the ones with no or limited structural information. In this work, we successfully applied AlphaFold in our end-to-end AI-powered drug discovery engines constituted of a biocomputational platform PandaOmics and a generative chemistry platform Chemistry42, to identify a first-in-class hit molecule of a novel target without an experimental structure starting from target selection towards hit identification in a cost- and time-efficient manner. PandaOmics provided the targets of interest and Chemistry42 generated the molecules based on the AlphaFold predicted structure, and the selected molecules were synthesized and tested in biological assays. Through this approach, we identified a small molecule hit compound for CDK20 with a Kd value of 8.9 +/- 1.6 uM (n = 4) within 30 days from target selection and after only synthesizing 7 compounds. Based on the available data, the second round of AI-powered compound generation was conducted and through which, a more potent hit molecule, ISM042-2 048, was discovered with a Kd value of 210.0 +/- 42.4 nM (n = 2), within 30 days and after synthesizing 6 compounds from the discovery of the first hit ISM042-2-001. To the best of our knowledge, this is the first reported small molecule targeting CDK20 and more importantly, this work is the first demonstration of AlphaFold application in the hit identification process in early drug discovery.

q-bio.BM↗

A distributed generalized Nash equilibrium seeking algorithm based on extremum seeking control

In this paper, a distributed non-model based seeking algorithm which combines the extremum seeking control (ESC) jointly with learning algorithms is proposed to seek a generalized Nash equilibrium (GNE) for a class of noncooperative games with coupled equality constraint. The strategy of each agent is restricted by both the coupled inter-agent constraint and local inequality constraints. Thanks to the ESC, it is unnecessary to know the specific expressions of agents' cost functions and local constraints and to know the strategies of other agents for the implementation of the proposed GNE seeking algorithm. To deal with the coupled constraints, only the Lagrange multiplier is transmitted among agents with some prior information about the coupled constraints. Moreover, a diminishing dither signal is designed in the seeking algorithm to remove undesirable steady-state oscillations. The non-local convergence of the designed seeking algorithm is analyzed via the singular perturbation theory, averaging analysis and Lyapunov stability theory. Numerical examples are given to verify the effectiveness of our proposed method.

math.OC↗

Nash Equilibrium Seeking for General Linear Systems with Disturbance Rejection

This paper explores aggregative games in a network of general linear systems subject to external disturbances. To deal with external disturbances, distributed strategy-updating rules based on internal model are proposed for the case with perfect and imperfect information, respectively. Different from existing algorithms based on gradient dynamics, by introducing the integral of gradient of cost functions on the basis of passive theory, the rules are proposed to force the strategies of all players to evolve to Nash equilibrium regardless the effect of disturbances. The convergence of the two strategy-updating rules is analyzed via Lyapunov stability theory, passive theory and singular perturbation theory. Simulations are presented to verify the obtained results.

math.OC↗

Clustered active-subspace based local Gaussian Process emulator for high-dimensional and complex computer models

Quantifying uncertainties in physical or engineering systems often requires a large number of simulations of the underlying computer models that are computationally intensive. Emulators or surrogate models are often used to accelerate the computation in such problems, and in this regard the Gaussian Process (GP) emulator is a popular choice for its ability to quantify the approximation error in the emulator itself. However, a major limitation of the GP emulator is that it can not handle problems of very high dimensions, which is often addressed with dimension reduction techniques. In this work we hope to address an issue that the models of interest are so complex that they admit different low dimensional structures in different parameter regimes. Building upon the active subspace method for dimension reduction, we propose a clustered active subspace method which identifies the local low-dimensional structures as well as the parameter regimes they are in (represented as clusters), and then construct low dimensional and local GP emulators within the clusters. Specifically we design a clustering method based on the gradient information to identify these clusters, and a local GP construction procedure to construct the GP emulator within a local cluster. With numerical examples, we demonstrate that the proposed method is effective when the underlying models are of complex low-dimensional structures.

stat.ME↗

Gaze Estimation with an Ensemble of Four Architectures

This paper presents a method for gaze estimation according to face images. We train several gaze estimators adopting four different network architectures, including an architecture designed for gaze estimation (i.e.,iTracker-MHSA) and three originally designed for general computer vision tasks(i.e., BoTNet, HRNet, ResNeSt). Then, we select the best six estimators and ensemble their predictions through a linear combination. The method ranks the first on the leader-board of ETH-XGaze Competition, achieving an average angular error of $3.11^{\circ}$ on the ETH-XGaze test set.

cs.CV↗

Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints

In this paper, we explore aggregative games over networks of multi-integrator agents with coupled constraints. To reach the general Nash equilibrium of an aggregative game, a distributed strategy-updating rule is proposed by a combination of the coordination of Lagrange multipliers and the estimation of the aggregator. Each player has only access to partial-decision information and communicates with his neighbors in a weight-balanced digraph which characterizes players' preferences as to the values of information received from neighbors. We first consider networks of double-integrator agents and then focus on multi-integrator agents. The effectiveness of the proposed strategy-updating rules is demonstrated by analyzing the convergence of corresponding dynamical systems via the Lyapunov stability theory, singular perturbation theory and passive theory. Numerical examples are given to illustrate our results.

math.OC↗

FlatteNet: A Simple Versatile Framework for Dense Pixelwise Prediction

In this paper, we focus on devising a versatile framework for dense pixelwise prediction whose goal is to assign a discrete or continuous label to each pixel for an image. It is well-known that the reduced feature resolution due to repeated subsampling operations poses a serious challenge to Fully Convolutional Network (FCN) based models. In contrast to the commonly-used strategies, such as dilated convolution and encoder-decoder structure, we introduce the Flattening Module to produce high-resolution predictions without either removing any subsampling operations or building a complicated decoder module. In addition, the Flattening Module is lightweight and can be easily combined with any existing FCNs, allowing the model builder to trade off among model size, computational cost and accuracy by simply choosing different backbone networks. We empirically demonstrate the effectiveness of the proposed Flattening Module through competitive results in human pose estimation on MPII, semantic segmentation on PASCAL-Context and object detection on PASCAL VOC. We hope that the proposed approach can serve as a simple and strong alternative of current dominant dense pixelwise prediction frameworks.

cs.CV↗

Bayesian inverse regression for dimension reduction with small datasets

We consider supervised dimension reduction problems, namely to identify a low dimensional projection of the predictors $\-x$ which can retain the statistical relationship between $\-x$ and the response variable $y$. We follow the idea of the sliced inverse regression (SIR) and the sliced average variance estimation (SAVE) type of methods, which is to use the statistical information of the conditional distribution $π(\-x|y)$ to identify the dimension reduction (DR) space. In particular we focus on the task of computing this conditional distribution without slicing the data. We propose a Bayesian framework to compute the conditional distribution where the likelihood function is obtained using the Gaussian process regression model. The conditional distribution $π(\-x|y)$ can then be computed directly via Monte Carlo sampling. We then can perform DR by considering certain moment functions (e.g. the first or the second moment) of the samples of the posterior distribution. With numerical examples, we demonstrate that the proposed method is especially effective for small data problems.

stat.CO↗