BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Jian Guo

Jian Guo appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
Artificial IntelligenceMachine LearningComputer VisionComputation and LanguageApplicationsastro-ph.COcond-mat.mtrl-sciDistributed, Parallel, and Cluster Computinggr-qcMethodologyphysics.opticsq-fin.CPq-fin.TRquant-phRobotics

Catalog footprint

What is connected

14works
15topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

14 published item(s)

preprint2026arXiv

DataArc-SynData-Toolkit: A Unified Closed-Loop Framework for Multi-Path, Multimodal, and Multilingual Data Synthesis

Synthetic data has emerged as a crucial solution to the data scarcity bottleneck in large language models (LLMs), particularly for specialized domains and low-resource languages. However, the broader adoption of existing synthetic data tools is severely hindered by convoluted workflows, fragmented data standards, and limited scalability across modalities. To address these limitations, we develop DataArc-SynData-Toolkit, an open-source framework featuring: (1) a configuration-driven, end-to-end pipeline equipped with an intuitive visual interface and simplified CLI for exceptional usability; (2) a unified, quality-controllable synthesis paradigm that standardizes multi-source data generation to ensure high reusability; and (3) a highly modular architecture designed for seamless multimodal, multilingual, and multi-task adaptation. We apply the toolkit in multiple application scenarios. Experimental results demonstrate that our toolkit achieves an optimal balance between generation efficiency and data quality. By offering an end-to-end and visually interactive pipeline, DataArc-SynData-Toolkit significantly lowers the technical barrier to synthetic data generation and subsequent model training, accelerating its practical deployment in real-world applications.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

ElegantRL-Podracer: Scalable and Elastic Library for Cloud-Native Deep Reinforcement Learning

Deep reinforcement learning (DRL) has revolutionized learning and actuation in applications such as game playing and robotic control. The cost of data collection, i.e., generating transitions from agent-environment interactions, remains a major challenge for wider DRL adoption in complex real-world problems. Following a cloud-native paradigm to train DRL agents on a GPU cloud platform is a promising solution. In this paper, we present a scalable and elastic library ElegantRL-podracer for cloud-native deep reinforcement learning, which efficiently supports millions of GPU cores to carry out massively parallel training at multiple levels. At a high-level, ElegantRL-podracer employs a tournament-based ensemble scheme to orchestrate the training process on hundreds or even thousands of GPUs, scheduling the interactions between a leaderboard and a training pool with hundreds of pods. At a low-level, each pod simulates agent-environment interactions in parallel by fully utilizing nearly 7,000 GPU CUDA cores in a single GPU. Our ElegantRL-podracer library features high scalability, elasticity and accessibility by following the development principles of containerization, microservices and MLOps. Using an NVIDIA DGX SuperPOD cloud, we conduct extensive experiments on various tasks in locomotion and stock trading and show that ElegantRL-podracer substantially outperforms RLlib. Our codes are available on GitHub.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

FinRL-Meta: A Universe of Near-Real Market Environments for Data-Driven Deep Reinforcement Learning in Quantitative Finance

Deep reinforcement learning (DRL) has shown huge potentials in building financial market simulators recently. However, due to the highly complex and dynamic nature of real-world markets, raw historical financial data often involve large noise and may not reflect the future of markets, degrading the fidelity of DRL-based market simulators. Moreover, the accuracy of DRL-based market simulators heavily relies on numerous and diverse DRL agents, which increases demand for a universe of market environments and imposes a challenge on simulation speed. In this paper, we present a FinRL-Meta framework that builds a universe of market environments for data-driven financial reinforcement learning. First, FinRL-Meta separates financial data processing from the design pipeline of DRL-based strategy and provides open-source data engineering tools for financial big data. Second, FinRL-Meta provides hundreds of market environments for various trading tasks. Third, FinRL-Meta enables multiprocessing simulation and training by exploiting thousands of GPU cores. Our codes are available online at https://github.com/AI4Finance-Foundation/FinRL-Meta.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Maximal coin-walker entanglement in a ballistic quantum walk

We report the position-inhomogeneous quantum walk (IQW) can be utilized to produce the maximal high dimensional entanglement while maintaining the quadratic speedup spread of the wave-function. Our calculations show that the maximal coin-walker entanglement can be generated in any odd steps or asymptotically in even steps, and the nearly maximal entanglement can be obtained in even steps after $2$. We implement the IQW by a stable resource-saving time-bin optical network, in which a polarization Sagnac loop is employed to realize the precisely tunable phase shift. Our approach opens up an efficient way for high-dimensional entanglement engineering as well as promotes investigations on the role of coin-walker interactions in QW based applications.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Quant 4.0: Engineering Quantitative Investment with Automated, Explainable and Knowledge-driven Artificial Intelligence

Quantitative investment (``quant'') is an interdisciplinary field combining financial engineering, computer science, mathematics, statistics, etc. Quant has become one of the mainstream investment methodologies over the past decades, and has experienced three generations: Quant 1.0, trading by mathematical modeling to discover mis-priced assets in markets; Quant 2.0, shifting quant research pipeline from small ``strategy workshops'' to large ``alpha factories''; Quant 3.0, applying deep learning techniques to discover complex nonlinear pricing rules. Despite its advantage in prediction, deep learning relies on extremely large data volume and labor-intensive tuning of ``black-box'' neural network models. To address these limitations, in this paper, we introduce Quant 4.0 and provide an engineering perspective for next-generation quant. Quant 4.0 has three key differentiating components. First, automated AI changes quant pipeline from traditional hand-craft modeling to the state-of-the-art automated modeling, practicing the philosophy of ``algorithm produces algorithm, model builds model, and eventually AI creates AI''. Second, explainable AI develops new techniques to better understand and interpret investment decisions made by machine learning black-boxes, and explains complicated and hidden risk exposures. Third, knowledge-driven AI is a supplement to data-driven AI such as deep learning and it incorporates prior knowledge into modeling to improve investment decision, in particular for quantitative value investing. Moreover, we discuss how to build a system that practices the Quant 4.0 concept. Finally, we propose ten challenging research problems for quant technology, and discuss potential solutions, research directions, and future trends.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Vision-Language Intelligence: Tasks, Representation Learning, and Large Models

This paper presents a comprehensive survey of vision-language (VL) intelligence from the perspective of time. This survey is inspired by the remarkable progress in both computer vision and natural language processing, and recent trends shifting from single modality processing to multiple modality comprehension. We summarize the development in this field into three time periods, namely task-specific methods, vision-language pre-training (VLP) methods, and larger models empowered by large-scale weakly-labeled data. We first take some common VL tasks as examples to introduce the development of task-specific methods. Then we focus on VLP methods and comprehensively review key components of the model structures and training methods. After that, we show how recent work utilizes large-scale raw image-text data to learn language-aligned visual representations that generalize better on zero or few shot learning tasks. Finally, we discuss some potential future trends towards modality cooperation, unified representation, and knowledge incorporation. We believe that this review will be of help for researchers and practitioners of AI and ML, especially those interested in computer vision and natural language processing.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

A model-based framework for learning transparent swarm behaviors

This paper proposes a model-based framework to automatically and efficiently design understandable and verifiable behaviors for swarms of robots. The framework is based on the automatic extraction of two distinct models: 1) a neural network model trained to estimate the relationship between the robots' sensor readings and the global performance of the swarm, and 2) a probabilistic state transition model that explicitly models the local state transitions (i.e., transitions in observations from the perspective of a single robot in the swarm) given a policy. The models can be trained from a data set of simulated runs featuring random policies. The first model is used to automatically extract a set of local states that are expected to maximize the global performance. These local states are referred to as desired local states. The second model is used to optimize a stochastic policy so as to increase the probability that the robots in the swarm observe one of the desired local states. Following these steps, the framework proposed in this paper can efficiently lead to effective controllers. This is tested on four case studies, featuring aggregation and foraging tasks. Importantly, thanks to the models, the framework allows us to understand and inspect a swarm's behavior. To this end, we propose verification checks to identify some potential issues that may prevent the swarm from achieving the desired global objective. In addition, we explore how the framework can be used in combination with a "standard" evolutionary robotics strategy (i.e., where performance is measured via simulation), or with online learning.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Bayesian Symbolic Regression

Interpretability is crucial for machine learning in many scenarios such as quantitative finance, banking, healthcare, etc. Symbolic regression (SR) is a classic interpretable machine learning method by bridging X and Y using mathematical expressions composed of some basic functions. However, the search space of all possible expressions grows exponentially with the length of the expression, making it infeasible for enumeration. Genetic programming (GP) has been traditionally and commonly used in SR to search for the optimal solution, but it suffers from several limitations, e.g. the difficulty in incorporating prior knowledge; overly-complicated output expression and reduced interpretability etc. To address these issues, we propose a new method to fit SR under a Bayesian framework. Firstly, Bayesian model can naturally incorporate prior knowledge (e.g., preference of basis functions, operators and raw features) to improve the efficiency of fitting SR. Secondly, to improve interpretability of expressions in SR, we aim to capture concise but informative signals. To this end, we assume the expected signal has an additive structure, i.e., a linear combination of several concise expressions, whose complexity is controlled by a well-designed prior distribution. In our setup, each expression is characterized by a symbolic tree, and the proposed SR model could be solved by sampling symbolic trees from the posterior distribution using an efficient Markov chain Monte Carlo (MCMC) algorithm. Finally, compared with GP, the proposed BSR(Bayesian Symbolic Regression) method saves computer memory with no need to keep an updated 'genome pool'. Numerical experiments show that, compared with GP, the solutions of BSR are closer to the ground truth and the expressions are more concise. Meanwhile we find the solution of BSR is robust to hyper-parameter specifications such as the number of trees.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

GluonCV and GluonNLP: Deep Learning in Computer Vision and Natural Language Processing

We present GluonCV and GluonNLP, the deep learning toolkits for computer vision and natural language processing based on Apache MXNet (incubating). These toolkits provide state-of-the-art pre-trained models, training scripts, and training logs, to facilitate rapid prototyping and promote reproducible research. We also provide modular APIs with flexible building blocks to enable efficient customization. Leveraging the MXNet ecosystem, the deep learning models in GluonCV and GluonNLP can be deployed onto a variety of platforms with different programming languages. The Apache 2.0 license has been adopted by GluonCV and GluonNLP to allow for software distribution, modification, and usage.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Gate-induced insulator to band-like transport transition in organolead halide perovskite

Understanding the intrinsic charge transport in organolead halide perovskites is essential for the development of high-efficiency photovoltaics and other optoelectronic devices. Despite the rapid advancement of the organolead halide perovskite in photovoltaic and optoelectronic applications, the intrinsic charge carrier transport in these materials remains elusive partly due to the difficulty of fabricating electrical devices and obtaining good electrical contact. Here, we report the fabrication of organolead halide perovskite microplates with monolayer graphene as low barrier electrical contact. A systematic charge transport studies reveal an insulator to band-like transport transition. Our studies indicate that the insulator to band-like transport transition depends on the orthorhombic-to-tetragonal phase transition temperature and defect densities of the organolead halide perovskite microplates. Our findings are not only important for the fundamental understanding of charge transport behavior but also offer valuable practical implications for photovoltaics and optoelectronic applications based on the organolead halide perovskite.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Deep CNN Ensemble with Data Augmentation for Object Detection

We report on the methods used in our recent DeepEnsembleCoco submission to the PASCAL VOC 2012 challenge, which achieves state-of-the-art performance on the object detection task. Our method is a variant of the R-CNN model proposed Girshick:CVPR14 with two key improvements to training and evaluation. First, our method constructs an ensemble of deep CNN models with different architectures that are complementary to each other. Second, we augment the PASCAL VOC training set with images from the Microsoft COCO dataset to significantly enlarge the amount training data. Importantly, we select a subset of the Microsoft COCO images to be consistent with the PASCAL VOC task. Results on the PASCAL VOC evaluation server show that our proposed method outperform all previous methods on the PASCAL VOC 2012 detection task at time of submission.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Estimating heterogeneous graphical models for discrete data with an application to roll call voting

We consider the problem of jointly estimating a collection of graphical models for discrete data, corresponding to several categories that share some common structure. An example for such a setting is voting records of legislators on different issues, such as defense, energy, and healthcare. We develop a Markov graphical model to characterize the heterogeneous dependence structures arising from such data. The model is fitted via a joint estimation method that preserves the underlying common graph structure, but also allows for differences between the networks. The method employs a group penalty that targets the common zero interaction effects across all the networks. We apply the method to describe the internal networks of the U.S. Senate on several important issues. Our analysis reveals individual structure for each issue, distinct from the underlying well-known bipartisan structure common to all categories which we are able to extract separately. We also establish consistency of the proposed method both for parameter estimation and model selection, and evaluate its numerical performance on a number of simulated examples.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Second-Harmonic Generation of Spoof Surface Plasmon Polaritons Using Nonlinear Plasmonic Metamaterials

The second harmonic generation is one of the most important applications of nonlinear effect, which has attracted great interests in nonlinear optics and microwave in the past decades. To the best of our knowledge, however, generating the second harmonics of surface plasmon polaritons (SPPs) has not been reported. Here, we propose to generate the second harmonics of spoof SPPs with high efficiency at microwave frequencies using subwavelength-scale nonlinear active device integrated on specially designed plasmonic waveguides, which are composed of two ultrathin corrugated metallic strips printed on the top and bottom surfaces of a thin dielectric slab anti-symmetrically. We show that the plasmonic waveguide supports broadband propagations of spoof SPPs with strong subwavelength effect, whose dispersion property can be controlled by changing the geometrical parameters. By loading the nonlinear device made from semiconductors to the intersection of two plasmonic waveguides with different corrugation depths, we experimentally demonstrate the efficient generation of second-harmonic SPPs in broad frequency band. The proposed second-harmonic generator can be directly used as SPP frequency multiplier, and the proposed method can be extended to achieve high-order harmonics and produce SPP mixers, which are essential to SPP integrated circuits and systems.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Astrodynamical Space Test of Relativity using Optical Devices I (ASTROD I) - A class-M fundamental physics mission proposal for Cosmic Vision 2015-2025: 2010 Update

This paper on ASTROD I is based on our 2010 proposal submitted for the ESA call for class-M mission proposals, and is a sequel and an update to our previous paper [Experimental Astronomy 23 (2009) 491-527; designated as Paper I] which was based on our last proposal submitted for the 2007 ESA call. In this paper, we present our orbit selection with one Venus swing-by together with orbit simulation. In Paper I, our orbit choice is with two Venus swing-bys. The present choice takes shorter time (about 250 days) to reach the opposite side of the Sun. We also present a preliminary design of the optical bench, and elaborate on the solar physics goals with the radiation monitor payload. We discuss telescope size, trade-offs of drag-free sensitivities, thermal issues and present an outlook. ASTROD I is a planned interplanetary space mission with multiple goals. The primary aims are: to test General Relativity with an improvement in sensitivity of over 3 orders of magnitude, improving our understanding of gravity and aiding the development of a new quantum gravity theory; to measure key solar system parameters with increased accuracy, advancing solar physics and our knowledge of the solar system; and to measure the time rate of change of the gravitational constant with an order of magnitude improvement and the anomalous Pioneer acceleration, thereby probing dark matter and dark energy gravitationally. It is envisaged as the first in a series of ASTROD missions. ASTROD I will consist of one spacecraft carrying a telescope, four lasers, two event timers and a clock. Two-way, two-wavelength laser pulse ranging will be used between the spacecraft in a solar orbit and deep space laser stations on Earth, to achieve the ASTROD I goals.

0 citations0 reviewsNo code linkedOpen access