Searcharxiv⌕ Search

arXiv subjects

Yuan Gao

Publications and source records attributed to Yuan Gao.

At least 379 records · Page 21Linked to original sources

Boosting Light-Weight Depth Estimation Via Knowledge Distillation

Monocular depth estimation (MDE) methods are often either too computationally expensive or not accurate enough due to the trade-off between model complexity and inference performance. In this paper, we propose a lightweight network that can accurately estimate depth maps using minimal computing resources. We achieve this by designing a compact model architecture that maximally reduces model complexity. To improve the performance of our lightweight network, we adopt knowledge distillation (KD) techniques. We consider a large network as an expert teacher that accurately estimates depth maps on the target domain. The student, which is the lightweight network, is then trained to mimic the teacher's predictions. However, this KD process can be challenging and insufficient due to the large model capacity gap between the teacher and the student. To address this, we propose to use auxiliary unlabeled data to guide KD, enabling the student to better learn from the teacher's predictions. This approach helps fill the gap between the teacher and the student, resulting in improved data-driven learning. Our extensive experiments show that our method achieves comparable performance to state-of-the-art methods while using only 1% of their parameters. Furthermore, our method outperforms previous lightweight methods regarding inference accuracy, computational efficiency, and generalizability.

cs.CV↗

Progressive Self-Distillation for Ground-to-Aerial Perception Knowledge Transfer

We study a practical yet hasn't been explored problem: how a drone can perceive in an environment from different flight heights. Unlike autonomous driving, where the perception is always conducted from a ground viewpoint, a flying drone may flexibly change its flight height due to specific tasks, requiring the capability for viewpoint invariant perception. Tackling the such problem with supervised learning will incur tremendous costs for data annotation of different flying heights. On the other hand, current semi-supervised learning methods are not effective under viewpoint differences. In this paper, we introduce the ground-to-aerial perception knowledge transfer and propose a progressive semi-supervised learning framework that enables drone perception using only labeled data of ground viewpoint and unlabeled data of flying viewpoints. Our framework has four core components: i) a dense viewpoint sampling strategy that splits the range of vertical flight height into a set of small pieces with evenly-distributed intervals, ii) nearest neighbor pseudo-labeling that infers labels of the nearest neighbor viewpoint with a model learned on the preceding viewpoint, iii) MixView that generates augmented images among different viewpoints to alleviate viewpoint differences, and iv) a progressive distillation strategy to gradually learn until reaching the maximum flying height. We collect a synthesized and a real-world dataset, and we perform extensive experimental analyses to show that our method yields 22.2% and 16.9% accuracy improvement for the synthesized dataset and the real world. Code and datasets are available on https://github.com/FreeformRobotics/Progressive-Self-Distillation-for-Ground-to-Aerial-Perception-Knowledge-Transfer.

cs.CV↗

On the asymptotic properties of a bagging estimator with a massive dataset

Bagging is a useful method for large-scale statistical analysis, especially when the computing resources are very limited. We study here the asymptotic properties of bagging estimators for $M$-estimation problems but with massive datasets. We theoretically prove that the resulting estimator is consistent and asymptotically normal under appropriate conditions. The results show that the bagging estimator can achieve the optimal statistical efficiency, provided that the bagging subsample size and the number of subsamples are sufficiently large. Moreover, we derive a variance estimator for valid asymptotic inference. All theoretical findings are further verified by extensive simulation studies. Finally, we apply the bagging method to the US Airline Dataset to demonstrate its practical usefulness.

math.ST↗

A review of distributed statistical inference

The rapid emergence of massive datasets in various fields poses a serious challenge to traditional statistical methods. Meanwhile, it provides opportunities for researchers to develop novel algorithms. Inspired by the idea of divide-and-conquer, various distributed frameworks for statistical estimation and inference have been proposed. They were developed to deal with large-scale statistical optimization problems. This paper aims to provide a comprehensive review for related literature. It includes parametric models, nonparametric models, and other frequently used models. Their key ideas and theoretical properties are summarized. The trade-off between communication cost and estimate precision together with other concerns are discussed.

stat.CO↗

Testing Sufficiency for Transfer Learning

Modern statistical analysis often encounters high dimensional models but with limited sample sizes. This makes the target data based statistical estimation very difficult. Then how to borrow information from another large sized source data for more accurate target model estimation becomes an interesting problem. This leads to the useful idea of transfer learning. Various estimation methods in this regard have been developed recently. In this work, we study transfer learning from a different perspective. Specifically, we consider here the problem of testing for transfer learning sufficiency. By transfer learning sufficiency (denoted as the null hypothesis), we mean that, with the help of the source data, the useful information contained in the feature vectors of the target data can be sufficiently extracted for predicting the interested target response. Therefore, the rejection of the null hypothesis implies that information useful for prediction remains in the feature vectors of the target data and thus calls for further exploration. To this end, we develop a novel testing procedure and a centralized and standardized test statistic, whose asymptotic null distribution is analytically derived. Simulation studies are presented to demonstrate the finite sample performance of the proposed method. A deep learning related real data example is presented for illustration purpose.

stat.ME↗

Random walk approximation for irreversible drift-diffusion process on manifold: ergodicity, unconditional stability and convergence

Irreversible drift-diffusion processes are very common in biochemical reactions. They have a non-equilibrium stationary state (invariant measure) which does not satisfy detailed balance. For the corresponding Fokker-Planck equation on a closed manifold, using Voronoi tessellation, we propose two upwind finite volume schemes with or without the information of the invariant measure. Both schemes possess stochastic $Q$-matrix structures and can be decomposed as a gradient flow part and a Hamiltonian flow part, enabling us to prove unconditional stability, ergodicity and error estimates. Based on the two upwind schemes, several numerical examples - including sampling accelerated by a mixture flow, image transformations and simulations for stochastic model of chaotic system - are conducted. These two structure-preserving schemes also give a natural random walk approximation for a generic irreversible drift-diffusion process on a manifold. This makes them suitable for adapting to manifold-related computations that arise from high-dimensional molecular dynamics simulations.

math.NA↗

Existence and uniqueness of solutions to the Peierls-Nabarro model in anisotropic media

We study the existence and uniqueness of solutions to the vector field Peierls-Nabarro model for curved dislocations in a transversely isotropic medium. Under suitable assumptions for the misfit potential on the slip plane, we reduce the 3D Peierls-Nabarro model to a nonlocal scalar Ginzburg-Landau equation. For a particular range of elastic coefficients, the nonlocal scalar equation with explicit nonlocal positive kernel is derived. We prove that any stable steady solution has a one-dimensional profile. As a result, we obtain that solutions to the scalar equation, as well as the original 3D system, are characterized as a one-parameter family of straight dislocations. This paper generalizes results found previously for the full isotropic case to an anisotropic setting.

math.AP↗

Nematic chiral spin liquid in a Kitaev magnet under external magnetic field

The possible existence of a quantum spin liquid (QSL) phase, an exotic state of matter with long-range quantum entanglement and fractionalized excitations, in $α$-RuCl$_3$ has sparked widespread interests in exploring QSLs in various Kitaev models under magnetic fields. Recently, a $K$-$J$-$Γ$-$Γ'$ model has been proposed to accurately describe the compound by fitting the measured thermodynamic data, where $J$ is Heisenberg interaction, and $Γ$, $Γ'$ are off-diagonal exchanges on top of the dominant Kitaev coupling $K$. Based on this effective model, an intermediate QSL phase in presence of an out-of-plane fields along the $[1 1 1]$ direction, between the low-field zigzag order and high-field polarized phase, has been predicted. By combining density matrix renormalization group (DMRG), exponential tensor renormalization group (XTRG), and variational Monte Carlo (VMC) calculations, we address the nature of this QSL phase in the honeycomb $K$-$J$-$Γ$-$Γ'$ model under the $[1 1 1]$-direction field. Our DMRG calculations find the algebraic-like decay of spin correlation function, the finite spin scalar chiral order, and lattice nematic order. Together with the XTRG results of power-law specific heat at low temperature, our findings naturally suggest a gapless nematic chiral spin liquid. On the other hand, our VMC study finds a gapped nematic chiral spin liquid with the variational energy very close to that obtained in DMRG. As VMC finds a very small gap that is beyond the current resolution of both ground-state DMRG and finite-temperature XTRG calculations on finite-width cylinders, we resort the full clarification for the nature of the intermediate QSL to future studies. Lastly, we discuss the implications of our results to the recent experiment on $α$-RuCl$_3$ and the QSL-like phase in a similar $K$-$Γ$-$Γ'$ model.

cond-mat.str-el↗

Learn2Agree: Fitting with Multiple Annotators without Objective Ground Truth

The annotation of domain experts is important for some medical applications where the objective ground truth is ambiguous to define, e.g., the rehabilitation for some chronic diseases, and the prescreening of some musculoskeletal abnormalities without further medical examinations. However, improper uses of the annotations may hinder developing reliable models. On one hand, forcing the use of a single ground truth generated from multiple annotations is less informative for the modeling. On the other hand, feeding the model with all the annotations without proper regularization is noisy given existing disagreements. For such issues, we propose a novel Learning to Agreement (Learn2Agree) framework to tackle the challenge of learning from multiple annotators without objective ground truth. The framework has two streams, with one stream fitting with the multiple annotators and the other stream learning agreement information between annotators. In particular, the agreement learning stream produces regularization information to the classifier stream, tuning its decision to be better in line with the agreement between annotators. The proposed method can be easily added to existing backbones, with experiments on two medical datasets showed better agreement levels with annotators.

cs.LG↗

Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates

We consider the problem of large-scale Fisher market equilibrium computation through scalable first-order optimization methods. It is well-known that market equilibria can be captured using structured convex programs such as the Eisenberg-Gale and Shmyrev convex programs. Highly performant deterministic full-gradient first-order methods have been developed for these programs. In this paper, we develop new block-coordinate first-order methods for computing Fisher market equilibria, and show that these methods have interpretations as tâtonnement-style or proportional response-style dynamics where either buyers or items show up one at a time. We reformulate these convex programs and solve them using proximal block coordinate descent methods, a class of methods that update only a small number of coordinates of the decision variable in each iteration. Leveraging recent advances in the convergence analysis of these methods and structures of the equilibrium-capturing convex programs, we establish fast convergence rates of these methods.

cs.GT↗

Modeling of Interface Loads for EOD Suit Wearers

Explosive Ordnance Disposal (EOD) suits are widely used to protect human operators to execute emergency tasks such as bomb disposal and neutralization. Current suit designs still need to be improved in terms of wearer comfort, which can be assessed based on the interaction forces at the human-suit contact regions. This paper introduces a simulation-based modeling framework that computes the interaction loads at the human-suit interface based on a wearer's kinematic movement data. The proposed modeling framework consists of three primary components: a) inertial and geometric modeling of the EOD suit, b) state estimation of the wearer's in-suit movement, and c) inverse dynamics analysis to calculate the human-suit interface forces based on the simulated human-suit model and the estimated human movement data. This simulation-based modeling method could be used to complement experimental testing for improving the time and cost efficiency of EOD suit evaluation. The accuracy of the simulated interface load was experimentally benchmarked during three different human tasks (each with three trials), by comparing the predicted interface forces with that measured by commercial pressure sensors.

eess.SP↗

Financial Distress Prediction For Small And Medium Enterprises Using Machine Learning Techniques

Financial Distress Prediction plays a crucial role in the economy by accurately forecasting the number and probability of failing structures, providing insight into the growth and stability of a country's economy. However, predicting financial distress for Small and Medium Enterprises is challenging due to their inherent ambiguity, leading to increased funding costs and decreased chances of receiving funds. While several strategies have been developed for effective FCP, their implementation, accuracy, and data security fall short of practical applications. Additionally, many of these strategies perform well for a portion of the dataset but are not adaptable to various datasets. As a result, there is a need to develop a productive prediction model for better order execution and adaptability to different datasets. In this review, we propose a feature selection algorithm for FCP based on element credits and data source collection. Current financial distress prediction models rely mainly on financial statements and disregard the timeliness of organization tests. Therefore, we propose a corporate FCP model that better aligns with industry practice and incorporates the gathering of thin-head component analysis of financial data, corporate governance qualities, and market exchange data with a Relevant Vector Machine. Experimental results demonstrate that this strategy can improve the forecast efficiency of financial distress with fewer characteristic factors.

cs.LG↗

IMPORTANT-Net: Integrated MRI Multi-Parameter Reinforcement Fusion Generator with Attention Network for Synthesizing Absent Data

Magnetic resonance imaging (MRI) is highly sensitive for lesion detection in the breasts. Sequences obtained with different settings can capture the specific characteristics of lesions. Such multi-parameter MRI information has been shown to improve radiologist performance in lesion classification, as well as improving the performance of artificial intelligence models in various tasks. However, obtaining multi-parameter MRI makes the examination costly in both financial and time perspectives, and there may be safety concerns for special populations, thus making acquisition of the full spectrum of MRI sequences less durable. In this study, different than naive input fusion or feature concatenation from existing MRI parameters, a novel $\textbf{I}$ntegrated MRI $\textbf{M}$ulti-$\textbf{P}$arameter reinf$\textbf{O}$rcement fusion generato$\textbf{R}$ wi$\textbf{T}$h $\textbf{A}$tte$\textbf{NT}$ion Network (IMPORTANT-Net) is developed to generate missing parameters. First, the parameter reconstruction module is used to encode and restore the existing MRI parameters to obtain the corresponding latent representation information at any scale level. Then the multi-parameter fusion with attention module enables the interaction of the encoded information from different parameters through a set of algorithmic strategies, and applies different weights to the information through the attention mechanism after information fusion to obtain refined representation information. Finally, a reinforcement fusion scheme embedded in a $V^{-}$-shape generation module is used to combine the hierarchical representations to generate the missing MRI parameter. Results showed that our IMPORTANT-Net is capable of generating missing MRI parameters and outperforms comparable state-of-the-art networks. Our code is available at https://github.com/Netherlands-Cancer-Institute/MRI_IMPORTANT_NET.

eess.IV↗

Synthesis-based Imaging-Differentiation Representation Learning for Multi-Sequence 3D/4D MRI

Multi-sequence MRIs can be necessary for reliable diagnosis in clinical practice due to the complimentary information within sequences. However, redundant information exists across sequences, which interferes with mining efficient representations by modern machine learning or deep learning models. To handle various clinical scenarios, we propose a sequence-to-sequence generation framework (Seq2Seq) for imaging-differentiation representation learning. In this study, not only do we propose arbitrary 3D/4D sequence generation within one model to generate any specified target sequence, but also we are able to rank the importance of each sequence based on a new metric estimating the difficulty of a sequence being generated. Furthermore, we also exploit the generation inability of the model to extract regions that contain unique information for each sequence. We conduct extensive experiments using three datasets including a toy dataset of 20,000 simulated subjects, a brain MRI dataset of 1,251 subjects, and a breast MRI dataset of 2,101 subjects, to demonstrate that (1) our proposed Seq2Seq is efficient and lightweight for complex clinical datasets and can achieve excellent image quality; (2) top-ranking sequences can be used to replace complete sequences with non-inferior performance; (3) combining MRI with our imaging-differentiation map leads to better performance in clinical tasks such as glioblastoma MGMT promoter methylation status prediction and breast cancer pathological complete response status prediction. Our code is available at https://github.com/fiy2W/mri_seq2seq.

cs.CV↗

Coulomb potential determining terahertz polarization in two-color laser field

The orientation and ellipticity of terahertz (THz) polarization generated by two-color strong field not only cast light on underlying mechanisms of laser-matter interaction, but also play an important role for various applications. We develop the Coulomb-corrected classical trajectory Monte Carlo (CTMC) method to well reproduce the joint measurements, that the THz polarization generated by the linearly-polarized 800 nm and circularly-polarized 400 nm fields is independent on two-color phase delay. The trajectory analysis shows that the Coulomb potential twists the THz polarization by deflecting the orientation of asymptotic momentum of electron trajectories. Further, the CTMC calculations predict that, the two-color mid-infrared field can effectively accelerate the electron rapidly away from the parent core to relieve the disturbance of Coulomb potential, and simultaneously create large transverse acceleration of trajectories, leading to the circularly-polarized THz radiation.

physics.optics↗

Rabinowitz Fukaya categories and the categorical formal punctured neighborhood of infinity

This paper constructs and studies the Rabinowitz (wrapped) Fukaya category, a categorical invariant of exact cylindrical Lagrangians in a Liouville manifold whose cohomological morphisms, ``Rabinowitz wrapped Floer homology groups" measure the failure of wrapped Floer cohomology to satisfy Poincare duality (and in particular vanish for any pair with at least one compact Lagrangian). Our main result, answering a conjecture of Abouzaid, relates the Rabinowitz and usual wrapped Fukaya category by way of a general construction introduced by Efimov, the categorical formal punctured neighborhood of infinity. As an application, we show how Rabinowitz Fukaya categories can be fit into - and in particular often computed in terms of - mirror symmetry.

math.SG↗

Wormhole MAML: Meta-Learning in Glued Parameter Space

In this paper, we introduce a novel variation of model-agnostic meta-learning, where an extra multiplicative parameter is introduced in the inner-loop adaptation. Our variation creates a shortcut in the parameter space for the inner-loop adaptation and increases model expressivity in a highly controllable manner. We show both theoretically and numerically that our variation alleviates the problem of conflicting gradients and improves training dynamics. We conduct experiments on 3 distinctive problems, including a toy classification problem for threshold comparison, a regression problem for wavelet transform, and a classification problem on MNIST. We also discuss ways to generalize our method to a broader class of problems.

cs.LG↗

1st Place Solution for YouTubeVOS Challenge 2022: Referring Video Object Segmentation

The task of referring video object segmentation aims to segment the object in the frames of a given video to which the referring expressions refer. Previous methods adopt multi-stage approach and design complex pipelines to obtain promising results. Recently, the end-to-end method based on Transformer has proved its superiority. In this work, we draw on the advantages of the above methods to provide a simple and effective pipeline for RVOS. Firstly, We improve the state-of-the-art one-stage method ReferFormer to obtain mask sequences that are strongly correlated with language descriptions. Secondly, based on a reliable and high-quality keyframe, we leverage the superior performance of video object segmentation model to further enhance the quality and temporal consistency of the mask results. Our single model reaches 70.3 J &F on the Referring Youtube-VOS validation set and 63.0 on the test set. After ensemble, we achieve 64.1 on the final leaderboard, ranking 1st place on CVPR2022 Referring Youtube-VOS challenge. Code will be available at https://github.com/Zhiweihhh/cvpr2022-rvos-challenge.git.

cs.CV↗