Searcharxiv⌕ Search

arXiv subjects

Ran Tao

Publications and source records attributed to Ran Tao.

At least 73 records · Page 4Linked to original sources
arXiv2024

CROPS: A Deployable Crop Management System Over All Possible State Availabilities

Exploring the optimal management strategy for nitrogen and irrigation has a significant impact on crop yield, economic profit, and the environment. To tackle this optimization challenge, this paper introduces a deployable \textbf{CR}op Management system \textbf{O}ver all \textbf{P}ossible \textbf{S}tate availabilities (CROPS). CROPS employs a language model (LM) as a reinforcement learning (RL) agent to explore optimal management strategies within the Decision Support System for Agrotechnology Transfer (DSSAT) crop simulations. A distinguishing feature of this system is that the states used for decision-making are partially observed through random masking. Consequently, the RL agent is tasked with two primary objectives: optimizing management policies and inferring masked states. This approach significantly enhances the RL agent's robustness and adaptability across various real-world agricultural scenarios. Extensive experiments on maize crops in Florida, USA, and Zaragoza, Spain, validate the effectiveness of CROPS. Not only did CROPS achieve State-of-the-Art (SOTA) results across various evaluation metrics such as production, profit, and sustainability, but the trained management policies are also immediately deployable in over of ten millions of real-world contexts. Furthermore, the pre-trained policies possess a noise resilience property, which enables them to minimize potential sensor biases, ensuring robustness and generalizability. Finally, unlike previous methods, the strength of CROPS lies in its unified and elegant structure, which eliminates the need for pre-defined states or multi-stage training. These advancements highlight the potential of CROPS in revolutionizing agricultural practices.

cs.AI↗
arXiv2024

Imprecise Label Learning: A Unified Framework for Learning with Various Imprecise Label Configurations

Learning with reduced labeling standards, such as noisy label, partial label, and multiple label candidates, which we generically refer to as \textit{imprecise} labels, is a commonplace challenge in machine learning tasks. Previous methods tend to propose specific designs for every emerging imprecise label configuration, which is usually unsustainable when multiple configurations of imprecision coexist. In this paper, we introduce imprecise label learning (ILL), a framework for the unification of learning with various imprecise label configurations. ILL leverages expectation-maximization (EM) for modeling the imprecise label information, treating the precise labels as latent variables.Instead of approximating the correct labels for training, it considers the entire distribution of all possible labeling entailed by the imprecise information. We demonstrate that ILL can seamlessly adapt to partial label learning, semi-supervised learning, noisy label learning, and, more importantly, a mixture of these settings. Notably, ILL surpasses the existing specified techniques for handling imprecise labels, marking the first unified framework with robust and effective performance across various challenging settings. We hope our work will inspire further research on this topic, unleashing the full potential of ILL in wider scenarios where precise labels are expensive and complicated to obtain.

cs.LG↗
arXiv2024

Robust Adaptive MPC Using Uncertainty Compensation

This paper presents an uncertainty compensation-based robust adaptive model predictive control (MPC) framework for linear systems with both matched and unmatched nonlinear uncertainties subject to both state and input constraints. In particular, the proposed control framework leverages an L1 adaptive controller (L1AC) to compensate for the matched uncertainties and to provide guaranteed uniform bounds on the error between the states and control inputs of the actual system and those of a nominal i.e., uncertainty-free, system. The performance bounds provided by the L1AC are then used to tighten the state and control constraints of the actual system, and a model predictive controller is designed for the nominal system with the tightened constraints. The proposed control framework, which we denote as uncertainty compensation-based MPC (UC-MPC), guarantees constraint satisfaction and achieves improved performance compared with existing methods. Simulation results on a flight control example demonstrate the benefits of the proposed framework.

eess.SY↗
arXiv2024

Enhancement of bacterial rheotaxis in non-Newtonian fluids

Bacteria often exhibit upstream swimming, which can cause the contamination of biomedical devices and the infection of organs including the urethra or lungs. This process, called rheotaxis, has been studied extensively in Newtonian fluids. However, most microorganisms thrive in non-Newtonian fluids that contain suspended polymers such as mucus and biofilms. Here, we investigate the rheotatic behavior of E. coli near walls in non-Newtonian fluids. Our experiments demonstrate that bacterial upstream swimming is enhanced by an order of magnitude in shear-thinning polymeric fluids relative to Newtonian fluids. This result is explained by direct numerical simulations, revealing a torque that promotes the alignment of bacteria against the flow. From this analysis, we develop a theoretical model that accurately describes experimental rheotatic data in both Newtonian and shear-thinning fluids.

physics.flu-dyn↗
arXiv2024

Giant enhancement of bacterial upstream swimming in macromolecular flows

Many bacteria live in natural and clinical environments with abundant macromolecular polymers. Macromolecular fluids commonly display viscoelasticity and non-Newtonian rheological behavior; it is unclear how these complex-fluid properties affect bacterial transport in flows. Here we combine high-resolution microscopy and numerical simulations to study bacterial response to shear flows of various macromolecular fluids. In stark contrast to the case in Newtonian shear flows, we found that flagellated bacteria in macromolecular flows display a giant capacity of upstream swimming (a behavior resembling fish swimming against current) near solid surfaces: The cells can counteract flow washing at shear rates up to ~65 $s^{-1}$, one order of magnitude higher than the limit for cells swimming in Newtonian flows. The significant enhancement of upstream swimming depends on two characteristic complex-fluid properties, namely viscoelasticity and shear-thinning viscosity; meanwhile, increasing the viscosity with a Newtonian polymer can prevent upstream motion. By visualizing flagellar bundles and modeling bacterial swimming in complex fluids, we explain the phenomenon as primarily arising from the augmentation of a "weathervane effect" in macromolecular flows due to the presence of a viscoelastic lift force and a shear-thinning induced azimuthal torque promoting the alignment of bacteria against the flow direction. Our findings shed light on bacterial transport and surface colonization in macromolecular environments, and may inform the design of artificial helical microswimmers for biomedical applications in physiological conditions.

cond-mat.soft↗
arXiv2024

ESVAE: An Efficient Spiking Variational Autoencoder with Reparameterizable Poisson Spiking Sampling

In recent years, studies on image generation models of spiking neural networks (SNNs) have gained the attention of many researchers. Variational autoencoders (VAEs), as one of the most popular image generation models, have attracted a lot of work exploring their SNN implementation. Due to the constrained binary representation in SNNs, existing SNN VAE methods implicitly construct the latent space by an elaborated autoregressive network and use the network outputs as the sampling variables. However, this unspecified implicit representation of the latent space will increase the difficulty of generating high-quality images and introduces additional network parameters. In this paper, we propose an efficient spiking variational autoencoder (ESVAE) that constructs an interpretable latent space distribution and design a reparameterizable spiking sampling method. Specifically, we construct the prior and posterior of the latent space as a Poisson distribution using the firing rate of the spiking neurons. Subsequently, we propose a reparameterizable Poisson spiking sampling method, which is free from the additional network. Comprehensive experiments have been conducted, and the experimental results show that the proposed ESVAE outperforms previous SNN VAE methods in reconstructed & generated images quality. In addition, experiments demonstrate that ESVAE's encoder is able to retain the original image information more efficiently, and the decoder is more robust. The source code is available at https://github.com/QgZhan/ESVAE.

cs.CV↗
arXiv2024

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. We show, however, that any such simulation needs to exploit huge coefficients: Resolution cannot be efficiently simulated by SA when the coefficients are written in unary. We also show that Reversible Resolution (a variant of MaxSAT Resolution) cannot be efficiently simulated by Nullstellensatz (NS). These results have consequences for total NP search problems. First, we characterise the classes PPADS, PPAD, SOPL by unary-SA, unary-NS, and Reversible Resolution, respectively. Second, we show that, relative to an oracle, PLS $\not\subseteq$ PPP, SOPL $\not\subseteq$ PPA, and EOPL $\not\subseteq$ UEOPL. In particular, together with prior work, this gives a complete picture of the black-box relationships between all classical TFNP classes introduced in the 1990s.

cs.CC↗
arXiv2024

DiffTune-MPC: Closed-Loop Learning for Model Predictive Control

Model predictive control (MPC) has been applied to many platforms in robotics and autonomous systems for its capability to predict a system's future behavior while incorporating constraints that a system may have. To enhance the performance of a system with an MPC controller, one can manually tune the MPC's cost function. However, it can be challenging due to the possibly high dimension of the parameter space as well as the potential difference between the open-loop cost function in MPC and the overall closed-loop performance metric function. This paper presents DiffTune-MPC, a novel learning method, to learn the cost function of an MPC in a closed-loop manner. The proposed framework is compatible with the scenario where the time interval for performance evaluation and MPC's planning horizon have different lengths. We show the auxiliary problem whose solution admits the analytical gradients of MPC and discuss its variations in different MPC settings, including nonlinear MPCs that are solved using sequential quadratic programming. Simulation results demonstrate the learning capability of DiffTune-MPC and the generalization capability of the learned MPC parameters.

cs.RO↗
arXiv2024

Characterization of Recirculating Waveguide Meshes Based on an Optimization Method with a Parameter Space Reduction Technology

Fabrication imperfections must be considered during configuration to ensure that the setup is suitable for the actual fabricated programmable photonic integrated circuits (PPICs). Therefore, characterization of imperfections is crucial but difficult, especially for PPICs made from recirculating waveguide meshes. The flexibility required by these meshes demands a more complex topology and compact TBU structure, complicating the characterization. In this paper, we propose a characterization method applicable to recirculating waveguide meshes based on an optimization approach, along with a step-by-step procedure to reduce the parameter space of optimization, allowing for characterizing imperfect parameters of each individual component within the waveguide mesh. To the best of our knowledge, this method can greatly broaden the range of characterized parameters compared to currently reported methods. In order to verify the effectiveness of our method, we used the characterized parameters to build a multi-frequency model of a mesh with fabrication errors and successfully demonstrated accurate prediction of its behavior. Furthermore, we applied our method on implementations of 6 different kind of FIR/IRR filters, to further prove the effectiveness of our method in configuring applications on meshes with fabrication errors. At last, our method was carried out under various scenarios considering beam splitter splitting ratio variance, inaccurate measurements of mesh and imprecise TBU insertion loss characterization, to demonstrate its strong robustness under various practical scenarios.

physics.optics↗
arXiv2024

Conv-Adapter: Exploring Parameter Efficient Transfer Learning for ConvNets

While parameter efficient tuning (PET) methods have shown great potential with transformer architecture on Natural Language Processing (NLP) tasks, their effectiveness with large-scale ConvNets is still under-studied on Computer Vision (CV) tasks. This paper proposes Conv-Adapter, a PET module designed for ConvNets. Conv-Adapter is light-weight, domain-transferable, and architecture-agnostic with generalized performance on different tasks. When transferring on downstream tasks, Conv-Adapter learns tasks-specific feature modulation to the intermediate representations of backbones while keeping the pre-trained parameters frozen. By introducing only a tiny amount of learnable parameters, e.g., only 3.5% full fine-tuning parameters of ResNet50. It can also be applied for transformer-based backbones. Conv-Adapter outperforms previous PET baseline methods and achieves comparable or surpasses the performance of full fine-tuning on 23 classification tasks of various domains. It also presents superior performance on the few-shot classification with an average margin of 3.39%. Beyond classification, Conv-Adapter can generalize to detection and segmentation tasks with more than 50% reduction of parameters but comparable performance to the traditional full fine-tuning.

cs.CV↗
arXiv2024

The New Agronomists: Language Models are Experts in Crop Management

Crop management plays a crucial role in determining crop yield, economic profitability, and environmental sustainability. Despite the availability of management guidelines, optimizing these practices remains a complex and multifaceted challenge. In response, previous studies have explored using reinforcement learning with crop simulators, typically employing simple neural-network-based reinforcement learning (RL) agents. Building on this foundation, this paper introduces a more advanced intelligent crop management system. This system uniquely combines RL, a language model (LM), and crop simulations facilitated by the Decision Support System for Agrotechnology Transfer (DSSAT). We utilize deep RL, specifically a deep Q-network, to train management policies that process numerous state variables from the simulator as observations. A novel aspect of our approach is the conversion of these state variables into more informative language, facilitating the language model's capacity to understand states and explore optimal management practices. The empirical results reveal that the LM exhibits superior learning capabilities. Through simulation experiments with maize crops in Florida (US) and Zaragoza (Spain), the LM not only achieves state-of-the-art performance under various evaluation metrics but also demonstrates a remarkable improvement of over 49\% in economic profit, coupled with reduced environmental impact when compared to baseline methods. Our code is available at \url{https://github.com/jingwu6/LM_AG}.

cs.LG↗
arXiv2024

Task-wise Sampling Convolutions for Arbitrary-Oriented Object Detection in Aerial Images

Arbitrary-oriented object detection (AOOD) has been widely applied to locate and classify objects with diverse orientations in remote sensing images. However, the inconsistent features for the localization and classification tasks in AOOD models may lead to ambiguity and low-quality object predictions, which constrains the detection performance. In this article, an AOOD method called task-wise sampling convolutions (TS-Conv) is proposed. TS-Conv adaptively samples task-wise features from respective sensitive regions and maps these features together in alignment to guide a dynamic label assignment for better predictions. Specifically, sampling positions of the localization convolution in TS-Conv are supervised by the oriented bounding box (OBB) prediction associated with spatial coordinates, while sampling positions and convolutional kernel of the classification convolution are designed to be adaptively adjusted according to different orientations for improving the orientation robustness of features. Furthermore, a dynamic task-consistent-aware label assignment (DTLA) strategy is developed to select optimal candidate positions and assign labels dynamically according to ranked task-aware scores obtained from TS-Conv. Extensive experiments on several public datasets covering multiple scenes, multimodal images, and multiple categories of objects demonstrate the effectiveness, scalability, and superior performance of the proposed TS-Conv.

cs.CV↗
arXiv2024

Understanding and Mitigating the Label Noise in Pre-training on Downstream Tasks

Pre-training on large-scale datasets and then fine-tuning on downstream tasks have become a standard practice in deep learning. However, pre-training data often contain label noise that may adversely affect the generalization of the model. This paper aims to understand the nature of noise in pre-training datasets and to mitigate its impact on downstream tasks. More specifically, through extensive experiments of supervised pre-training models on synthetic noisy ImageNet-1K and YFCC15M datasets, we demonstrate that while slight noise in pre-training can benefit in-domain (ID) transfer performance, where the training and testing data share the same distribution, it always deteriorates out-of-domain (OOD) performance, where training and testing data distribution are different. We empirically verify that the reason behind is noise in pre-training shapes the feature space differently. We then propose a light-weight black-box tuning method (NMTune) to affine the feature space to mitigate the malignant effect of noise and improve generalization on both ID and OOD tasks, considering one may not be able to fully fine-tune or even access the pre-trained models. We conduct practical experiments on popular vision and language models that are pre-trained on noisy data for evaluation of our approach. Our analysis and results show the importance of this interesting and novel research direction, which we term Noisy Model Learning.

cs.LG↗
arXiv2023

Mesoscopic averaging of the two-dimensional KPZ equation

We study the limit of a local average of the KPZ equation in dimension $d=2$ with general initial data in the subcritical regime. Our result shows that a proper spatial averaging of the KPZ equation converges in distribution to the sum of the solution to a deterministic KPZ equation and a Gaussian random variable that depends solely on the scale of averaging. This shows a unique mesoscopic averaging phenomenon that is only present in dimension two. Our work is inspired by the recent findings by Chatterjee \cite{chatterjee2021weak}.

math.PR↗
arXiv2023

On the multiplicative independence between $n$ and $\lfloor αn\rfloor$

In this article we investigate different forms of multiplicative independence between the sequences $n$ and $\lfloor n α\rfloor$ for irrational $α$. Our main theorem shows that for a large class of arithmetic functions $a, b \colon \mathbb{N} \to \mathbb{C}$ the sequences $(a(n))_{n \in \mathbb{N}}$ and $(b ( \lfloor αn \rfloor))_{n \in \mathbb{N}}$ are asymptotically uncorrelated. This new theorem is then applied to prove a $2$-dimensional version of the Erdős-Kac theorem, asserting that the sequences $(ω(n))_{n \in \mathbb{N}}$ and $(ω( \lfloor αn \rfloor)_{n\in \mathbb{N}}$ behave as independent normally distributed random variables with mean $\log\log n$ and standard deviation $\sqrt{ \log \log n}$. Our main result also implies a variation on Chowla's Conjecture asserting that the logarithmic average of $(λ(n) λ( \lfloor αn \rfloor))_{n \in \mathbb{N}}$ tends to $0$.

math.NT↗
arXiv2023

Single-shot Phase Retrieval from a Fractional Fourier Transform Perspective

The realm of classical phase retrieval concerns itself with the arduous task of recovering a signal from its Fourier magnitude measurements, which are fraught with inherent ambiguities. A single-exposure intensity measurement is commonly deemed insufficient for the reconstruction of the primal signal, given that the absent phase component is imperative for the inverse transformation. In this work, we present a novel single-shot phase retrieval paradigm from a fractional Fourier transform (FrFT) perspective, which involves integrating the FrFT-based physical measurement model within a self-supervised reconstruction scheme. Specifically, the proposed FrFT-based measurement model addresses the aliasing artifacts problem in the numerical calculation of Fresnel diffraction, featuring adaptability to both short-distance and long-distance propagation scenarios. Moreover, the intensity measurement in the FrFT domain proves highly effective in alleviating the ambiguities of phase retrieval and relaxing the previous conditions on oversampled or multiple measurements in the Fourier domain. Furthermore, the proposed self-supervised reconstruction approach harnesses the fast discrete algorithm of FrFT alongside untrained neural network priors, thereby attaining preeminent results. Through numerical simulations, we demonstrate that both amplitude and phase objects can be effectively retrieved from a single-shot intensity measurement using the proposed approach and provide a promising technique for support-free coherent diffraction imaging.

cs.CV↗
arXiv2023

Concealed Electronic Countermeasures of Radar Signal with Adversarial Examples

Electronic countermeasures involving radar signals are an important aspect of modern warfare. Traditional electronic countermeasures techniques typically add large-scale interference signals to ensure interference effects, which can lead to attacks being too obvious. In recent years, AI-based attack methods have emerged that can effectively solve this problem, but the attack scenarios are currently limited to time domain radar signal classification. In this paper, we focus on the time-frequency images classification scenario of radar signals. We first propose an attack pipeline under the time-frequency images scenario and DITIMI-FGSM attack algorithm with high transferability. Then, we propose STFT-based time domain signal attack(STDS) algorithm to solve the problem of non-invertibility in time-frequency analysis, thus obtaining the time-domain representation of the interference signal. A large number of experiments show that our attack pipeline is feasible and the proposed attack method has a high success rate.

eess.SP↗
arXiv2023

Backup Plan Constrained Model Predictive Control with Guaranteed Stability

This article proposes and evaluates a new safety concept called backup plan safety for path planning of autonomous vehicles under mission uncertainty using model predictive control (MPC). Backup plan safety is defined as the ability to complete an alternative mission when the primary mission is aborted. To include this new safety concept in control problems, we formulate a feasibility maximization problem aiming to maximize the feasibility of the primary and alternative missions. The feasibility maximization problem is based on multi-objective MPC, where each objective (cost function) is associated with a different mission and balanced by a weight vector. Furthermore, the feasibility maximization problem incorporates additional control input horizons toward the alternative missions on top of the control input horizon toward the primary mission, denoted as multi-horizon inputs, to evaluate the cost for each mission. We develop the backup plan constrained MPC algorithm, which designs the weight vector that ensures asymptotic stability of the closed-loop system, and generates the optimal control input by solving the feasibility maximization problem with computational efficiency. The performance of the proposed algorithm is validated through simulations of a UAV path planning problem.

eess.SY↗