Searcharxiv⌕ Search

arXiv subjects

Li Chen

Publications and source records attributed to Li Chen.

At least 325 records · Page 18Linked to original sources
arXiv2024

Parabolic Anderson model in bounded domains of recurrent metric measure spaces

A metric measure space equipped with a Dirichlet form is called recurrent if its Hausdorff dimension is less than its walk dimension. In bounded domains of such spaces we study the parabolic Anderson models \[ \partial_{t} u(t,x) = Δu(t,x) + βu(t,x) \, \dot{W}_α(t,x) \] where the noise $W_α$ is white in time and colored in space when $α>0$ while for $α=0$ it is also white in space. Both Dirichlet and Neumann boundary conditions are considered. Besides proving existence and uniqueness in the Itô sense we also get precise $L^p$ estimates for the moments and intermittency properties of the solution as a consequence. Our study reveals new exponents which are intrinsically associated to the geometry of the underlying space and the results for instance apply in metric graphs or fractals like the Sierpiński gasket for which we prove scaling invariance properties of the models.

math.PR↗
arXiv2023

Visual Point Cloud Forecasting enables Scalable Autonomous Driving

In contrast to extensive studies on general vision, pre-training for scalable visual autonomous driving remains seldom explored. Visual autonomous driving applications require features encompassing semantics, 3D geometry, and temporal information simultaneously for joint perception, prediction, and planning, posing dramatic challenges for pre-training. To resolve this, we bring up a new pre-training task termed as visual point cloud forecasting - predicting future point clouds from historical visual input. The key merit of this task captures the synergic learning of semantics, 3D structures, and temporal dynamics. Hence it shows superiority in various downstream tasks. To cope with this new problem, we present ViDAR, a general model to pre-train downstream visual encoders. It first extracts historical embeddings by the encoder. These representations are then transformed to 3D geometric space via a novel Latent Rendering operator for future point cloud prediction. Experiments show significant gain in downstream tasks, e.g., 3.1% NDS on 3D detection, ~10% error reduction on motion forecasting, and ~15% less collision rate on planning.

cs.CV↗
arXiv2023

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow

We give the first almost-linear time algorithms for several problems in incremental graphs including cycle detection, strongly connected component maintenance, $s$-$t$ shortest path, maximum flow, and minimum-cost flow. To solve these problems, we give a deterministic data structure that returns a $m^{o(1)}$-approximate minimum-ratio cycle in fully dynamic graphs in amortized $m^{o(1)}$ time per update. Combining this with the interior point method framework of Brand-Liu-Sidford (STOC 2023) gives the first almost-linear time algorithm for deciding the first update in an incremental graph after which the cost of the minimum-cost flow attains value at most some given threshold $F$. By rather direct reductions to minimum-cost flow, we are then able to solve the problems in incremental graphs mentioned above. At a high level, our algorithm dynamizes the $\ell_1$ oblivious routing of Rozhoň-Grunau-Haeupler-Zuzic-Li (STOC 2022), and develops a method to extract an approximate minimum ratio cycle from the structure of the oblivious routing. To maintain the oblivious routing, we use tools from concurrent work of Kyng-Meierhans-Probst Gutenberg which designed vertex sparsifiers for shortest paths, in order to maintain a sparse neighborhood cover in fully dynamic graphs. To find a cycle, we first show that an approximate minimum ratio cycle can be represented as a fundamental cycle on a small set of trees resulting from the oblivious routing. Then, we find a cycle whose quality is comparable to the best tree cycle. This final cycle query step involves vertex and edge sparsification procedures reminiscent of previous works, but crucially requires a more powerful dynamic spanner which can handle far more edge insertions. We build such a spanner via a construction that hearkens back to the classic greedy spanner algorithm.

cs.DS↗
arXiv2023

ALMA High-resolution Spectral Survey of Thioformaldehyde (H2CS) Towards Massive Protoclusters

Investigating the temperature and density structures of gas in massive protoclusters is crucial for understanding the chemical properties therein. In this study, we present observations of the continuum and thioformaldehyde (H2CS) lines at 345 GHz of 11 massive protoclusters using the Atacama Large Millimeter/submillimeter Array (ALMA) telescope. High spatial resolution and sensitivity observations have detected 145 continuum cores from the 11 sources. H2CS line transitions are observed in 72 out of 145 cores, including line-rich cores, warm cores and cold cores. The H2 column densities of the 72 cores are estimated from the continuum emission which are larger than the density threshold value for star formation, suggesting that H2CS can be widely distributed in star-forming cores with different physical environments. Rotation temperature and column density of H2CS are derived by use of the XCLASS software. The results show the H2CS abundances increase as temperature rises and higher gas temperatures are usually associated with higher H2CS column densities. The abundances of H2CS are positively correlated with its column density, suggesting that the H2CS abundances are enhanced from cold cores, warm cores to line-rich cores in star forming regions.

astro-ph.GA↗
arXiv2023

Decoding trust: A reinforcement learning perspective

Behavioral experiments on the trust game have shown that trust and trustworthiness are universal among human beings, contradicting the prediction by assuming \emph{Homo economicus} in orthodox Economics. This means some mechanism must be at work that favors their emergence. Most previous explanations however need to resort to some factors based upon imitative learning, a simple version of social learning. Here, we turn to the paradigm of reinforcement learning, where individuals update their strategies by evaluating the long-term return through accumulated experience. Specifically, we investigate the trust game with the Q-learning algorithm, where each participant is associated with two evolving Q-tables that guide one's decision making as trustor and trustee respectively. In the pairwise scenario, we reveal that high levels of trust and trustworthiness emerge when individuals appreciate both their historical experience and returns in the future. Mechanistically, the evolution of the Q-tables shows a crossover that resembles human's psychological changes. We also provide the phase diagram for the game parameters, where the boundary analysis is conducted. These findings are robust when the scenario is extended to a latticed population. Our results thus provide a natural explanation for the emergence of trust and trustworthiness without external factors involved. More importantly, the proposed paradigm shows the potential in deciphering many puzzles in human behaviors.

q-bio.PE↗
arXiv2023

The first Ka-band (26.1-35 GHz) blind line survey towards Orion KL

We conducted a Ka-band (26.1--35 GHz) line survey towards Orion KL using the TianMa 65-m Radio Telescope (TMRT). It is the first blind line survey in the Ka band, and achieves a sensitivity of mK level (1--3 mK at a spectral resolution of $\sim$1 km s$^{-1}$). In total, 592 Gaussian features are extracted. Among them, 257 radio recombination lines (RRLs) are identified. The maximum $Δn$ of RRLs of H, He and C are 20, 15, and 5, respectively. Through stacking, we have detected the $β$ lines of ion RRLs (RRLs of C$^+$ with possible contribution of other ions like O$^+$) for the first time, and tentative signal of the $γ$ lines of ion RRLs can also be seen on the stacked spectrum. Besides, 318 other line features were assigned to 37 molecular species, and ten of these species were not detected in the Q-band survey of TMRT. The vibrationally excited states of nine species were also detected. Emission of most species can be modeled under LTE. A number of transitions of E-CH3OH ($J_2-J_1$) display maser effects, which are confirmed by our modeling, and besides the bumping peak at $J\sim 6$ there is another peak at $J\sim 13$. Methylcyanoacetylene (CH$_3$C$_3$N) is detected in Orion KL for the first time. This work emphasizes that the Ka band, which was long-ignored for spectral line surveys, is very useful for surveying RRLs and molecular lines simultaneously.

astro-ph.GA↗
arXiv2023

Audio-visual Saliency for Omnidirectional Videos

Visual saliency prediction for omnidirectional videos (ODVs) has shown great significance and necessity for omnidirectional videos to help ODV coding, ODV transmission, ODV rendering, etc.. However, most studies only consider visual information for ODV saliency prediction while audio is rarely considered despite its significant influence on the viewing behavior of ODV. This is mainly due to the lack of large-scale audio-visual ODV datasets and corresponding analysis. Thus, in this paper, we first establish the largest audio-visual saliency dataset for omnidirectional videos (AVS-ODV), which comprises the omnidirectional videos, audios, and corresponding captured eye-tracking data for three video sound modalities including mute, mono, and ambisonics. Then we analyze the visual attention behavior of the observers under various omnidirectional audio modalities and visual scenes based on the AVS-ODV dataset. Furthermore, we compare the performance of several state-of-the-art saliency prediction models on the AVS-ODV dataset and construct a new benchmark. Our AVS-ODV datasets and the benchmark will be released to facilitate future research.

cs.CV↗
arXiv2023

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time

We provide an algorithm which, with high probability, maintains a $(1-ε)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} ε^{-3}$ time per update. To obtain this result, we provide a more general algorithm that solves what we call the incremental, thresholded $p$-norm flow problem that asks to determine the first edge-insertion in an undirected graph that causes the minimum $\ell_p$-norm flow to decrease below a given threshold in value. Since we solve this thresholded problem, our data structure succeeds against an adaptive adversary that can only see the data structure's output. Furthermore, since our algorithm holds for $p = 2$, we obtain improved algorithms for dynamically maintaining the effective resistance between a pair of vertices in an undirected graph undergoing edge insertions. Our algorithm builds upon previous dynamic algorithms for approximately solving the minimum-ratio cycle problem that underlie previous advances on the maximum flow problem [Chen-Kyng-Liu-Peng-Probst Gutenberg-Sachdeva, FOCS '22] as well as recent dynamic maximum flow algorithms [v.d.Brand-Liu-Sidford, STOC '23]. Instead of using interior point methods, which were a key component of these recent advances, our algorithm uses an optimization method based on $\ell_p$-norm iterative refinement and the multiplicative weight update method. This ensures a monotonicity property in the minimum-ratio cycle subproblems that allows us to apply known data structures and bypass issues arising from adaptive queries.

cs.DS↗
arXiv2023

OpenLane-V2: A Topology Reasoning Benchmark for Unified 3D HD Mapping

Accurately depicting the complex traffic scene is a vital component for autonomous vehicles to execute correct judgments. However, existing benchmarks tend to oversimplify the scene by solely focusing on lane perception tasks. Observing that human drivers rely on both lanes and traffic signals to operate their vehicles safely, we present OpenLane-V2, the first dataset on topology reasoning for traffic scene structure. The objective of the presented dataset is to advance research in understanding the structure of road scenes by examining the relationship between perceived entities, such as traffic elements and lanes. Leveraging existing datasets, OpenLane-V2 consists of 2,000 annotated road scenes that describe traffic elements and their correlation to the lanes. It comprises three primary sub-tasks, including the 3D lane detection inherited from OpenLane, accompanied by corresponding metrics to evaluate the model's performance. We evaluate various state-of-the-art methods, and present their quantitative and qualitative results on OpenLane-V2 to indicate future avenues for investigating topology reasoning in traffic scenes.

cs.CV↗
arXiv2023

Well-posedness of diffusion-aggregation equations with bounded kernels and their mean-field approximations

The well-posedness and regularity properties of diffusion-aggregation equations, emerging from interacting particle systems, are established on the whole space for bounded interaction force kernels by utilizing a compactness convergence argument to treat the nonlinearity as well as a Moser iteration. Moreover, we prove a quantitative estimate in probability with arbitrary algebraic rate between the approximative interacting particle systems and the approximative McKean-Vlasov SDEs, which implies propagation of chaos for the interacting particle systems.

math.AP↗
arXiv2023

B-rep Boolean Resulting Model Repair by Correcting Intersection Edges Based on Inference Procedure

As the most essential part of CAD modeling operations, boolean operations on B-rep CAD models often suffer from errors. Errors caused by geometric precision or numerical uncertainty are hard to eliminate. They will reduce the reliability of boolean operations and damage the integrity of the resulting models. And it is difficult to repair false boolean resulting models damaged by errors. In practice, we find that the illegal boolean resulting models stem from the false intersection edges caused by errors. Therefore, this paper proposes an automatic method based on set reasoning to repair flawed structures of the boolean resulting models by correcting their topological intersection edges. We provide a local adaptive tolerance estimation method for each intersection edge based on its geometric features as well as its origin. Then, we propose a set of inference mechanisms based on set operations to infer whether a repair is needed based on the tolerance value and how to correct the inaccurate intersection edge. Our inference strategies are strictly proven, ensuring the reliability and robustness of the repair process. The inference process will transform the problem into a geometric equivalent form less susceptible to errors to get a more accurate intersection edge. Since our inference procedure focuses on topological features, our method can repair the flawed boolean resulting models, no matter what source of errors causes the problem.

cs.GR↗
arXiv2023

Contrastive Self-Supervised Learning for Spatio-Temporal Analysis of Lung Ultrasound Videos

Self-supervised learning (SSL) methods have shown promise for medical imaging applications by learning meaningful visual representations, even when the amount of labeled data is limited. Here, we extend state-of-the-art contrastive learning SSL methods to 2D+time medical ultrasound video data by introducing a modified encoder and augmentation method capable of learning meaningful spatio-temporal representations, without requiring constraints on the input data. We evaluate our method on the challenging clinical task of identifying lung consolidations (an important pathological feature) in ultrasound videos. Using a multi-center dataset of over 27k lung ultrasound videos acquired from over 500 patients, we show that our method can significantly improve performance on downstream localization and classification of lung consolidation. Comparisons against baseline models trained without SSL show that the proposed methods are particularly advantageous when the size of labeled training data is limited (e.g., as little as 5% of the training set).

eess.IV↗
arXiv2023

Communication-Efficient Design for Quantized Decentralized Federated Learning

Decentralized federated learning (DFL) is a variant of federated learning, where edge nodes only communicate with their one-hop neighbors to learn the optimal model. However, as information exchange is restricted in a range of one-hop in DFL, inefficient information exchange leads to more communication rounds to reach the targeted training loss. This greatly reduces the communication efficiency. In this paper, we propose a new non-uniform quantization of model parameters to improve DFL convergence. Specifically, we apply the Lloyd-Max algorithm to DFL (LM-DFL) first to minimize the quantization distortion by adjusting the quantization levels adaptively. Convergence guarantee of LM-DFL is established without convex loss assumption. Based on LM-DFL, we then propose a new doubly-adaptive DFL, which jointly considers the ascending number of quantization levels to reduce the amount of communicated information in the training and adapts the quantization levels for non-uniform gradient distributions. Experiment results based on MNIST and CIFAR-10 datasets illustrate the superiority of LM-DFL with the optimal quantized distortion and show that doubly-adaptive DFL can greatly improve communication efficiency.

cs.DC↗
arXiv2023

A low-mass line-rich core found in Massive Star-forming Region IRAS 16351-4722

We present ALMA sub-arcsecond-resolution observations of both continuum and molecular lines at 345 GHz towards the massive star-forming region IRAS 16351-4722 (hereafter I16351). A total of 12 dust cores were detected based on high spatial resolution observations of the continuum. Among them, a high-mass core (11.6 Msun) and a low-mass core (1.7 Msun) show abundant molecular line emissions. 164 molecular transitions from 29 species and 104 molecular transitions from 25 species are identified in the high-mass and low-mass cores, respectively. Complex organic molecules (COMs) such as CH3OH, CH3OCHO, CH3OCH3, C2H5OH, and C2H5CN are detected in the two cores. Under the assumption of local thermodynamic equilibrium (LTE), rotational temperatures and column densities of the COMs are derived with the XCLASS software. The maximum rotation temperature values in the low-mass core and the high-mass core were found to be approximately 130 K and 198 K, respectively. Additionally, the line widths in the high-mass core are larger than those in the low-mass one. Abundant complex organic molecular line transitions, high gas temperatures, and smaller line widths indicate the presence of a low-mass line-rich core in the massive star formation region for the first time, while the high-mass line-rich core shows hot core property. When comparing the molecular abundances of CH3OH, CH3OCHO, CH3OCH3 and C2H5OH of the two cores with other hot cores and hot corinos reported in the literature, we further confirm that both a hot core and a low-mass line-rich core are simultaneously detected in I16351.

astro-ph.GA↗
arXiv2023

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow

We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the first running time improvement for deterministic algorithms that compute maximum-flow in graphs with polynomial bounded capacities since the work of Goldberg-Rao [J.ACM '98]. Our algorithm builds on the framework of Chen-Kyng-Liu-Peng-Gutenberg-Sachdeva [FOCS '22] that computes an optimal flow by computing a sequence of $m^{1+o(1)}$-approximate undirected minimum-ratio cycles. We develop a deterministic dynamic graph data-structure to compute such a sequence of minimum-ratio cycles in an amortized $m^{o(1)}$ time per edge update. Our key technical contributions are deterministic analogues of the vertex sparsification and edge sparsification components of the data-structure from Chen et al. For the vertex sparsification component, we give a method to avoid the randomness in Chen et al. which involved sampling random trees to recurse on. For the edge sparsification component, we design a deterministic algorithm that maintains an embedding of a dynamic graph into a sparse spanner. We also show how our dynamic spanner can be applied to give a deterministic data structure that maintains a fully dynamic low-stretch spanning tree on graphs with polynomially bounded edge lengths, with subpolynomial average stretch and subpolynomial amortized time per edge update.

cs.DS↗
arXiv2023

Delving into the Devils of Bird's-eye-view Perception: A Review, Evaluation and Recipe

Learning powerful representations in bird's-eye-view (BEV) for perception tasks is trending and drawing extensive attention both from industry and academia. Conventional approaches for most autonomous driving algorithms perform detection, segmentation, tracking, etc., in a front or perspective view. As sensor configurations get more complex, integrating multi-source information from different sensors and representing features in a unified view come of vital importance. BEV perception inherits several advantages, as representing surrounding scenes in BEV is intuitive and fusion-friendly; and representing objects in BEV is most desirable for subsequent modules as in planning and/or control. The core problems for BEV perception lie in (a) how to reconstruct the lost 3D information via view transformation from perspective view to BEV; (b) how to acquire ground truth annotations in BEV grid; (c) how to formulate the pipeline to incorporate features from different sources and views; and (d) how to adapt and generalize algorithms as sensor configurations vary across different scenarios. In this survey, we review the most recent works on BEV perception and provide an in-depth analysis of different solutions. Moreover, several systematic designs of BEV approach from the industry are depicted as well. Furthermore, we introduce a full suite of practical guidebook to improve the performance of BEV perception tasks, including camera, LiDAR and fusion inputs. At last, we point out the future research directions in this area. We hope this report will shed some light on the community and encourage more research effort on BEV perception. We keep an active repository to collect the most recent work and provide a toolbox for bag of tricks at https://github.com/OpenDriveLab/Birds-eye-view-Perception

cs.CV↗
arXiv2023

The ALMA Survey of Star Formation and Evolution in Massive Protoclusters with Blue Profiles (ASSEMBLE): Core Growth, Cluster Contraction, and Primordial Mass Segregation

The ALMA Survey of Star Formation and Evolution in Massive Protoclusters with Blue Profiles (ASSEMBLE) aims to investigate the process of mass assembly and its connection to high-mass star formation theories in protoclusters in a dynamic view. We observed 11 massive (Mclump>1000 Msun), luminous (Lbol>10,000 Lsun), and blue-profile (infall signature) clumps by ALMA with resolution of 2200-5500 au at 350 GHz (870 um) in continuum and line emission. 248 dense cores were identified, including 106 cores showing protostellar signatures and 142 prestellar core candidates. Compared to early-stage infrared dark clouds (IRDCs) by ASHES, the core mass and surface density within the ASSEMBLE clumps exhibited significant increment, suggesting concurrent core accretion during the evolution of the clumps. The maximum mass of prestellar cores was found to be 2 times larger than that in IRDCs, indicating evolved protoclusters have the potential to harbor massive prestellar cores. The mass relation between clumps and their most massive core (MMCs) is observed in ASSEMBLE but not in IRDCs, which is suggested to be regulated by multiscale mass accretion. The mass correlation between the core clusters and their MMCs has a steeper slope compared to that observed in stellar clusters, which can be due to fragmentation of the MMC and stellar multiplicity. We observe a decrease in core separation and an increase in central concentration as protoclusters evolve. We confirm primordial mass segregation in the ASSEMBLE protoclusters, possibly resulting from gravitational concentration and/or gas accretion.

astro-ph.GA↗
arXiv2023

Time-resolved laser speckle contrast imaging (TR-LSCI) of cerebral blood flow

To address many of the deficiencies in optical neuroimaging technologies such as poor spatial resolution, time-consuming reconstruction, low penetration depth, and contact-based measurement, a novel, noncontact, time-resolved laser speckle contrast imaging (TR-LSCI) technique has been developed for continuous, fast, and high-resolution 2D mapping of cerebral blood flow (CBF) at different depths of the head. TR-LSCI illuminates the head with picosecond-pulsed, coherent, widefield near-infrared light and synchronizes a newly developed, high-resolution, gated single-photon avalanche diode camera (SwissSPAD2) to capture CBF maps at different depths. By selectively collecting diffuse photons with longer pathlengths through the head, TR-LSCI reduces partial volume artifacts from the overlying tissues, thus improving the accuracy of CBF measurement in the deep brain. CBF map reconstruction was dramatically expedited by incorporating highly parallelized computation. The performance of TR-LSCI was evaluated using head-simulating phantoms with known properties and in-vivo rodents with varied hemodynamic challenges to the brain. Results from these pilot studies demonstrated that TR-LSCI enabled mapping CBF variations at different depths with a sampling rate of up to 1 Hz and spatial resolutions ranging from tens of micrometers on the head surface to 1-2 millimeters in the deep brain. With additional improvements and validation in larger populations against established methods, we anticipate offering a noncontact, fast, high-resolution, portable, and affordable brain imager for fundamental neuroscience research in animals and for translational studies in humans.

physics.med-ph↗