BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yan Xu

Yan Xu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Computer Visionastro-ph.SRArtificial IntelligenceComputation and LanguageMachine LearningRoboticsastro-ph.IMCryptography and Securityastro-ph.GAcond-mat.mtrl-scieess.IVeess.SPGenomicsInformation Theorymath.APmath.DGmath.ITmath.NAmath.OCmath.PRMultiagent SystemsNumerical Analysisphysics.atom-phphysics.comp-phphysics.opticsq-fin.TRQuantitative Methods

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
34works
0followers
27topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

34 published item(s)

preprint2026arXiv

PIVOT: Bridging Planning and Execution in LLM Agents via Trajectory Refinement

Large language model (LLM)-based agents frequently generate seemingly coherent plans that fail upon execution due to infeasible actions, constraint violations, and compounding errors over extended horizons. PIVOT (Plan-Inspect-eVOlve Trajectories) addresses this plan-execution misalignment through a self-supervised framework that treats trajectories as optimizable objects iteratively refined via environment interaction. The framework comprises four stages: PLAN generates candidate trajectories; INSPECT executes them and computes structured losses with textual gradients encoding plan-execution discrepancies; EVOLVE applies these signals to produce improved trajectories; and VERIFY performs a final global check against task constraints. A monotonic acceptance process ensures a non-decreasing solution quality. Empirical evaluations on DeepPlanning and GAIA demonstrate state-of-the-art performance: with human-in-the-loop (HITL) feedback, PIVOT establishes a strong upper bound up to 94% relative improvement in constraint satisfaction, while its fully autonomous variant retains substantial gains, showing that the core trajectory-refinement mechanism remains effective without external supervision. At the same time, PIVOT remains computationally efficient, requiring up to 3x to 5x fewer tokens than competing refinement methods. These findings establish that (self- or human-supervised) feedback-based trajectory optimization is a principled methodology for mitigating plan-execution gaps in autonomous agent systems.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Analytic smoothing effect of the time variable for the spatially homogeneous Landau equation

In this work, we study the Cauchy problem of the spatially homogeneous Landau equation with hard potentials in a close-to-quilibrium framework. We prove that the solution to the Cauchy problem enjoys the analytic regularizing effect of the time variable with an L2 initial datum for positive time. So that the smoothing effect of Cauchy problem for the spatially homogeneous Landau equation with hard potentials is exactly same as heat equation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Can Question Rewriting Help Conversational Question Answering?

Question rewriting (QR) is a subtask of conversational question answering (CQA) aiming to ease the challenges of understanding dependencies among dialogue history by reformulating questions in a self-contained form. Despite seeming plausible, little evidence is available to justify QR as a mitigation method for CQA. To verify the effectiveness of QR in CQA, we investigate a reinforcement learning approach that integrates QR and CQA tasks and does not require corresponding QR datasets for targeted CQA. We find, however, that the RL method is on par with the end-to-end baseline. We provide an analysis of the failure and describe the difficulty of exploiting QR for CQA.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Improving Visual Grounding with Visual-Linguistic Verification and Iterative Reasoning

Visual grounding is a task to locate the target indicated by a natural language expression. Existing methods extend the generic object detection framework to this problem. They base the visual grounding on the features from pre-generated proposals or anchors, and fuse these features with the text embeddings to locate the target mentioned by the text. However, modeling the visual features from these predefined locations may fail to fully exploit the visual context and attribute information in the text query, which limits their performance. In this paper, we propose a transformer-based framework for accurate visual grounding by establishing text-conditioned discriminative features and performing multi-stage cross-modal reasoning. Specifically, we develop a visual-linguistic verification module to focus the visual features on regions relevant to the textual descriptions while suppressing the unrelated areas. A language-guided feature encoder is also devised to aggregate the visual contexts of the target object to improve the object's distinctiveness. To retrieve the target from the encoded visual features, we further propose a multi-stage cross-modal decoder to iteratively speculate on the correlations between the image and text for accurate target localization. Extensive experiments on five widely used datasets validate the efficacy of our proposed components and demonstrate state-of-the-art performance. Our code is public at https://github.com/yangli18/VLTVG.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Iterative Adaptively Regularized LASSO-ADMM Algorithm for CFAR Estimation of Sparse Signals: IAR-LASSO-ADMM-CFAR Algorithm

The least-absolute shrinkage and selection operator (LASSO) is a regularization technique for estimating sparse signals of interest emerging in various applications and can be efficiently solved via the alternating direction method of multipliers (ADMM), which will be termed as LASSO-ADMM algorithm. The choice of the regularization parameter has significant impact on the performance of LASSO-ADMM algorithm. However, the optimization for the regularization parameter in the existing LASSO-ADMM algorithms has not been solved yet. In order to optimize this regularization parameter, we propose an efficient iterative adaptively regularized LASSO-ADMM (IAR-LASSO-ADMM) algorithm by iteratively updating the regularization parameter in the LASSO-ADMM algorithm. Moreover, a method is designed to iteratively update the regularization parameter by adding an outer iteration to the LASSO-ADMM algorithm. Specifically, at each outer iteration the zero support of the estimate obtained by the inner LASSO-ADMM algorithm is utilized to estimate the noise variance, and the noise variance is utilized to update the threshold according to a pre-defined const false alarm rate (CFAR). Then, the resulting threshold is utilized to update both the non-zero support of the estimate and the regularization parameter, and proceed to the next inner iteration. In addition, a suitable stopping criterion is designed to terminate the outer iteration process to obtain the final non-zero support of the estimate of the sparse measurement signals. The resulting algorithm is termed as IAR-LASSO-ADMM-CFAR algorithm. Finally, simulation results have been presented to show that the proposed IAR-LASSO-ADMM-CFAR algorithm outperforms the conventional LASSO-ADMM algorithm and other existing algorithms in terms of reconstruction accuracy, and its sparsity order estimate is more accurate than the existing algorithms.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Nanoscale three-dimensional magnetic sensing with a probabilistic nanomagnet driven by spin-orbit torque

Detection of vector magnetic fields at nanoscale dimensions is critical in applications ranging from basic material science, to medical diagnostic. Meanwhile, an all-electric operation is of great significance for achieving a simple and compact sensing system. Here, we propose and experimentally demonstrate a simple approach to sensing a vector magnetic field at nanoscale dimensions, by monitoring a probabilistic nanomagnet's transition probability from a metastable state, excited by a driving current due to SOT, to a settled state. We achieve sensitivities for Hx, Hy, and Hz of 1.02%/Oe, 1.09%/Oe and 3.43%/Oe, respectively, with a 200 x 200 nm^2 nanomagnet. The minimum detectable field is dependent on the driving pulse events N, and is expected to be as low as 1 uT if N = 3 x 10^6.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Retrieval-Free Knowledge-Grounded Dialogue Response Generation with Adapters

To diversify and enrich generated dialogue responses, knowledge-grounded dialogue has been investigated in recent years. The existing methods tackle the knowledge grounding challenge by retrieving the relevant sentences over a large corpus and augmenting the dialogues with explicit extra information. Despite their success, however, the existing works have drawbacks in inference efficiency. This paper proposes KnowExpert, a framework to bypass the explicit retrieval process and inject knowledge into the pre-trained language models with lightweight adapters and adapt to the knowledge-grounded dialogue task. To the best of our knowledge, this is the first attempt to tackle this challenge without retrieval in this task under an open-domain chit-chat scenario. The experimental results show that Knowexpert performs comparably with some retrieval-based baselines while being time-efficient in inference, demonstrating the effectiveness of our proposed method.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

RNNPose: Recurrent 6-DoF Object Pose Refinement with Robust Correspondence Field Estimation and Pose Optimization

6-DoF object pose estimation from a monocular image is challenging, and a post-refinement procedure is generally needed for high-precision estimation. In this paper, we propose a framework based on a recurrent neural network (RNN) for object pose refinement, which is robust to erroneous initial poses and occlusions. During the recurrent iterations, object pose refinement is formulated as a non-linear least squares problem based on the estimated correspondence field (between a rendered image and the observed image). The problem is then solved by a differentiable Levenberg-Marquardt (LM) algorithm enabling end-to-end training. The correspondence field estimation and pose refinement are conducted alternatively in each iteration to recover the object poses. Furthermore, to improve the robustness to occlusion, we introduce a consistency-check mechanism based on the learned descriptors of the 3D model and observed 2D images, which downweights the unreliable correspondences during pose optimization. Extensive experiments on LINEMOD, Occlusion-LINEMOD, and YCB-Video datasets validate the effectiveness of our method and demonstrate state-of-the-art performance.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Robust Self-Supervised LiDAR Odometry via Representative Structure Discovery and 3D Inherent Error Modeling

The correct ego-motion estimation basically relies on the understanding of correspondences between adjacent LiDAR scans. However, given the complex scenarios and the low-resolution LiDAR, finding reliable structures for identifying correspondences can be challenging. In this paper, we delve into structure reliability for accurate self-supervised ego-motion estimation and aim to alleviate the influence of unreliable structures in training, inference and mapping phases. We improve the self-supervised LiDAR odometry substantially from three aspects: 1) A two-stage odometry estimation network is developed, where we obtain the ego-motion by estimating a set of sub-region transformations and averaging them with a motion voting mechanism, to encourage the network focusing on representative structures. 2) The inherent alignment errors, which cannot be eliminated via ego-motion optimization, are down-weighted in losses based on the 3D point covariance estimations. 3) The discovered representative structures and learned point covariances are incorporated in the mapping module to improve the robustness of map construction. Our two-frame odometry outperforms the previous state of the arts by 16%/12% in terms of translational/rotational errors on the KITTI dataset and performs consistently well on the Apollo-Southbay datasets. We can even rival the fully supervised counterparts with our mapping module and more unlabeled training data.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

SelfVoxeLO: Self-supervised LiDAR Odometry with Voxel-based Deep Neural Networks

Recent learning-based LiDAR odometry methods have demonstrated their competitiveness. However, most methods still face two substantial challenges: 1) the 2D projection representation of LiDAR data cannot effectively encode 3D structures from the point clouds; 2) the needs for a large amount of labeled data for training limit the application scope of these methods. In this paper, we propose a self-supervised LiDAR odometry method, dubbed SelfVoxeLO, to tackle these two difficulties. Specifically, we propose a 3D convolution network to process the raw LiDAR data directly, which extracts features that better encode the 3D geometric patterns. To suit our network to self-supervised learning, we design several novel loss functions that utilize the inherent properties of LiDAR point clouds. Moreover, an uncertainty-aware mechanism is incorporated in the loss functions to alleviate the interference of moving objects/noises. We evaluate our method's performances on two large-scale datasets, i.e., KITTI and Apollo-SouthBay. Our method outperforms state-of-the-art unsupervised methods by 27%/32% in terms of translational/rotational errors on the KITTI dataset and also performs well on the Apollo-SouthBay dataset. By including more unlabelled training data, our method can further improve performance comparable to the supervised methods.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Transformer based multiple instance learning for weakly supervised histopathology image segmentation

Hispathological image segmentation algorithms play a critical role in computer aided diagnosis technology. The development of weakly supervised segmentation algorithm alleviates the problem of medical image annotation that it is time-consuming and labor-intensive. As a subset of weakly supervised learning, Multiple Instance Learning (MIL) has been proven to be effective in segmentation. However, there is a lack of related information between instances in MIL, which limits the further improvement of segmentation performance. In this paper, we propose a novel weakly supervised method for pixel-level segmentation in histopathology images, which introduces Transformer into the MIL framework to capture global or long-range dependencies. The multi-head self-attention in the Transformer establishes the relationship between instances, which solves the shortcoming that instances are independent of each other in MIL. In addition, deep supervision is introduced to overcome the limitation of annotations in weakly supervised methods and make the better utilization of hierarchical information. The state-of-the-art results on the colon cancer dataset demonstrate the superiority of the proposed method compared with other weakly supervised methods. It is worth believing that there is a potential of our approach for various applications in medical images.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

WSSS4LUAD: Grand Challenge on Weakly-supervised Tissue Semantic Segmentation for Lung Adenocarcinoma

Lung cancer is the leading cause of cancer death worldwide, and adenocarcinoma (LUAD) is the most common subtype. Exploiting the potential value of the histopathology images can promote precision medicine in oncology. Tissue segmentation is the basic upstream task of histopathology image analysis. Existing deep learning models have achieved superior segmentation performance but require sufficient pixel-level annotations, which is time-consuming and expensive. To enrich the label resources of LUAD and to alleviate the annotation efforts, we organize this challenge WSSS4LUAD to call for the outstanding weakly-supervised semantic segmentation (WSSS) techniques for histopathology images of LUAD. Participants have to design the algorithm to segment tumor epithelial, tumor-associated stroma and normal tissue with only patch-level labels. This challenge includes 10,091 patch-level annotations (the training set) and over 130 million labeled pixels (the validation and test sets), from 87 WSIs (67 from GDPH, 20 from TCGA). All the labels were generated by a pathologist-in-the-loop pipeline with the help of AI models and checked by the label review board. Among 532 registrations, 28 teams submitted the results in the test phase with over 1,000 submissions. Finally, the first place team achieved mIoU of 0.8413 (tumor: 0.8389, stroma: 0.7931, normal: 0.8919). According to the technical reports of the top-tier teams, CAM is still the most popular approach in WSSS. Cutmix data augmentation has been widely adopted to generate more reliable samples. With the success of this challenge, we believe that WSSS approaches with patch-level annotations can be a complement to the traditional pixel annotations while reducing the annotation efforts. The entire dataset has been released to encourage more researches on computational pathology in LUAD and more novel WSSS techniques.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

CelebA-Spoof Challenge 2020 on Face Anti-Spoofing: Methods and Results

As facial interaction systems are prevalently deployed, security and reliability of these systems become a critical issue, with substantial research efforts devoted. Among them, face anti-spoofing emerges as an important area, whose objective is to identify whether a presented face is live or spoof. Recently, a large-scale face anti-spoofing dataset, CelebA-Spoof which comprised of 625,537 pictures of 10,177 subjects has been released. It is the largest face anti-spoofing dataset in terms of the numbers of the data and the subjects. This paper reports methods and results in the CelebA-Spoof Challenge 2020 on Face AntiSpoofing which employs the CelebA-Spoof dataset. The model evaluation is conducted online on the hidden test set. A total of 134 participants registered for the competition, and 19 teams made valid submissions. We will analyze the top ranked solutions and present some discussion on future work directions.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Multi-hop Question Generation with Graph Convolutional Network

Multi-hop Question Generation (QG) aims to generate answer-related questions by aggregating and reasoning over multiple scattered evidence from different paragraphs. It is a more challenging yet under-explored task compared to conventional single-hop QG, where the questions are generated from the sentence containing the answer or nearby sentences in the same paragraph without complex reasoning. To address the additional challenges in multi-hop QG, we propose Multi-Hop Encoding Fusion Network for Question Generation (MulQG), which does context encoding in multiple hops with Graph Convolutional Network and encoding fusion via an Encoder Reasoning Gate. To the best of our knowledge, we are the first to tackle the challenge of multi-hop reasoning over paragraphs without any sentence-level information. Empirical results on HotpotQA dataset demonstrate the effectiveness of our method, in comparison with baselines on automatic evaluation metrics. Moreover, from the human evaluation, our proposed model is able to generate fluent questions with high completeness and outperforms the strongest baseline by 20.8% in the multi-hop evaluation. The code is publicly available at https://github.com/HLTCHKUST/MulQG}{https://github.com/HLTCHKUST/MulQG .

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Multi-Passband Observations of A Solar Flare over the He I 10830 Å line

This study presents a C3.0 flare observed by the BBSO/GST and IRIS, on 2018-May-28 around 17:10 UT. The Near Infrared Imaging Spectropolarimeter (NIRIS) of GST was set to spectral imaging mode to scan five spectral positions at $\pm$ 0.8 Å, $\pm$ 0.4 Åand line center of He I 10830. At the flare ribbon's leading edge the line is observed to undergo enhanced absorption, while the rest of the ribbon is observed to be in emission. When in emission, the contrast compared to the pre-flare ranges from about $30~\%$ to nearly $100~\%$ at different spectral positions. Two types of spectra, "convex" shape with higher intensity at line core and "concave" shape with higher emission in the line wings, are found at the trailing and peak flaring areas, respectively. On the ribbon front, negative contrasts, or enhanced absorption, of about $\sim 10\% - 20\%$ appear in all five wavelengths. This observation strongly suggests that the negative flares observed in He I 10830 with mono-filtergram previously were not caused by pure Doppler shifts of this spectral line. Instead, the enhanced absorption appears to be a consequence of flare energy injection, namely non-thermal collisional ionization of helium caused by the precipitation of high energy electrons, as found in our recent numerical modeling results. In addition, though not strictly simultaneous, observations of Mg II from the IRIS spacecraft, show an obvious central reversal pattern at the locations where enhanced absorption of He I 10830 is seen, which is in consistent with previous observations.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A New Comprehensive Data Set of Solar Filaments of 100 yr Interval. I

Filaments are very common physical phenomena on the Sun and are often taken as important proxies of solar magnetic activities. The study of filaments has become a hot topic in the space weather research. For a more comprehensive understanding of filaments, especially for an understanding of solar activities of multiple solar cycles, it is necessary to perform a combined multifeature analysis by constructing a data set of multiple solar cycle data. To achieve this goal, we constructed a centennial data set that covers the H$α$ data from five observatories around the world. During the data set construction, we encountered varieties of problems, such as data fusion, accurate determination of the solar edge, classifying data by quality, dynamic threshold, and so on, which arose mainly due to multiple sources and a large time span of data. But fortunately, these problems were well solved. The data set includes seven types of data products and eight types of feature parameters with which we can implement the functions of data searching and statistical analyses. It has the characteristics of better continuity and highly complementary to space observation data, especially in the wavelengths not covered by space observations, and covers many solar cycles (including more than 60 yr of high-cadence data). We expect that this new comprehensive data set as well as the tools will help researchers to significantly speed up their search for features or events of interest, for either statistical or case study purposes, and possibly help them get a better and more comprehensive understanding of solar filament mechanisms.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Public Website for the Automated Assessment and Validation of SARS-CoV-2 Diagnostic PCR Assays

Summary: Polymerase chain reaction-based assays are the current gold standard for detecting and diagnosing SARS-CoV-2. However, as SARS-CoV-2 mutates, we need to constantly assess whether existing PCR-based assays will continue to detect all known viral strains. To enable the continuous monitoring of SARS-CoV-2 assays, we have developed a web-based assay validation algorithm that checks existing PCR-based assays against the ever-expanding genome databases for SARS-CoV-2 using both thermodynamic and edit-distance metrics. The assay screening results are displayed as a heatmap, showing the number of mismatches between each detection and each SARS-CoV-2 genome sequence. Using a mismatch threshold to define detection failure, assay performance is summarized with the true positive rate (recall) to simplify assay comparisons. Availability: https://covid19.edgebioinformatics.org/#/assayValidation. Contact: Jason Gans (jgans@lanl.gov) and Patrick Chain (pchain@lanl.gov)

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

An ultraweak-local discontinuous Galerkin method for PDEs with high order spatial derivatives

In this paper, we develop a new discontinuous Galerkin method for solving several types of partial differential equations (PDEs) with high order spatial derivatives. We combine the advantages of local discontinuous Galerkin (LDG) method and ultra-weak discontinuous Galerkin (UWDG) method. Firstly, we rewrite the PDEs with high order spatial derivatives into a lower order system, then apply the UWDG method to the system. We first consider the fourth order and fifth order nonlinear PDEs in one space dimension, and then extend our method to general high order problems and two space dimensions. The main advantage of our method over the LDG method is that we have introduced fewer auxiliary variables, thereby reducing memory and computational costs. The main advantage of our method over the UWDG method is that no internal penalty terms are necessary in order to ensure stability for both even and odd order PDEs. We prove stability of our method in the general nonlinear case and provide optimal error estimates for linear PDEs for the solution itself as well as for the auxiliary variables approximating its derivatives. A key ingredient in the proof of the error estimates is the construction of the relationship between the derivative and the element interface jump of the numerical solution and the auxiliary variable solution of the solution derivative. With this relationship, we can then use the discrete Sobolev and Poincaré inequalities to obtain the optimal error estimates. The theoretical findings are confirmed by numerical experiments.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Comparison of Enhanced Absorption in He I 10830 Å in Observations and Modeling During the Early Phase of a Solar Flare

The He I 10830 Å triplet is a very informative indicator of chromospheric activities as the helium is the second most abundant element in the solar atmosphere. Taking advantage of the high resolution of the 1.6 m Goode Solar Telescope (GST) at Big Bear Solar Observatory (BBSO), previous observations have shown clear evidence of the enhanced absorption, instead of typically-observed emission, for two M-class flares. In this study, we analyze the evolution of the He I 10830 10830 Å emission in numerical models and compare it with observations. The models represent the RADYN simulation results obtained from the F-CHROMA database. We consider the models with the injected electron spectra parameters close to observational estimates for the 2013-August-17 flare event ($δ=8$, $E_c = \{15,20\}$ keV, $F=\{1\times 10^{11}, 3\times{}10^{11}\}$ erg cm$^{-2}$) in detail, as well as other available models. The modeling results agree well with observations, in the sense of both the maximum intensity decrease (-17.1%, compared to the observed value of -13.7%) and the trend of temporal variation (initial absorption phase followed by the emission). All models demonstrate the increased number densities and decreased ratio of the upper and lower level populations of He I 10830 10830 Å transition in the initial phase, which enhances the opacity and forms an absorption feature. Models suggest that the temperatures and free electron densities at heights of 1.3-1.5 Mm should be larger than $\sim 10^4$ K and $6\times 10^{11}$ cm$^{-3}$ thresholds for the line to start being in emission.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Differential rotation of the halo traced by the K-giant stars

We use K-giant stars selected from the LAMOST DR5 to study the variation of the rotational velocity of the galactic halo at different space positions. Modelling the rotational velocity distribution with both the halo and disk components, we find that the rotational velocity of the halo population decreases almost linearly with increasing vertical distance to the galactic disk plane, $Z$, at fixed galactocentric radius, $R$. The samples are separated into two parts with $6<R<12$ kpc and $12<R<20$ kpc. We derive that the decreasing rates along $Z$ for the two subsamples are $-3.07\pm0.63$ and $-1.89\pm0.37$ km s$^{-1}$ kpc$^{-1}$, respectively. Compared with the TNG simulations, we suggest that this trend is probably caused by the interaction between the disk and halo. The results from the simulations show that only the oblate halo can provide a decreasing rotational velocity with an increasing $Z$. This indicates that the Galactic halo is oblate with galactocentric radius $R<20$ kpc. On the other hand, the flaring of the disk component (mainly the thick disk) is clearly traced by this study, with $R$ between 12 and 20 kpc, the disk can vertically extend to $6\sim10$ kpc above the disk plane. What is more interesting is that, we find the Gaia-Enceladus-Sausage (GES) component has a significant contribution only in the halo with $R<12$ kpc, i.e. a fraction of 23$-$47\%. While in the outer subsample, the contribution is too low to be well constrained.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Differentially Private Combinatorial Cloud Auction

Cloud service providers typically provide different types of virtual machines (VMs) to cloud users with various requirements. Thanks to its effectiveness and fairness, auction has been widely applied in this heterogeneous resource allocation. Recently, several strategy-proof combinatorial cloud auction mechanisms have been proposed. However, they fail to protect the bid privacy of users from being inferred from the auction results. In this paper, we design a differentially private combinatorial cloud auction mechanism (DPCA) to address this privacy issue. Technically, we employ the exponential mechanism to compute a clearing unit price vector with a probability proportional to the corresponding revenue. We further improve the mechanism to reduce the running time while maintaining high revenues, by computing a single clearing unit price, or a subgroup of clearing unit prices at a time, resulting in the improved mechanisms DPCA-S and its generalized version DPCA-M, respectively. We theoretically prove that our mechanisms can guarantee differential privacy, approximate truthfulness and high revenue. Extensive experimental results demonstrate that DPCA can generate near-optimal revenues at the price of relatively high time complexity, while the improved mechanisms achieve a tunable trade-off between auction revenue and running time.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Estimating 3D Camera Pose from 2D Pedestrian Trajectories

We consider the task of re-calibrating the 3D pose of a static surveillance camera, whose pose may change due to external forces, such as birds, wind, falling objects or earthquakes. Conventionally, camera pose estimation can be solved with a PnP (Perspective-n-Point) method using 2D-to-3D feature correspondences, when 3D points are known. However, 3D point annotations are not always available or practical to obtain in real-world applications. We propose an alternative strategy for extracting 3D information to solve for camera pose by using pedestrian trajectories. We observe that 2D pedestrian trajectories indirectly contain useful 3D information that can be used for inferring camera pose. To leverage this information, we propose a data-driven approach by training a neural network (NN) regressor to model a direct mapping from 2D pedestrian trajectories projected on the image plane to 3D camera pose. We demonstrate that our regressor trained only on synthetic data can be directly applied to real data, thus eliminating the need to label any real data. We evaluate our method across six different scenes from the Town Centre Street and DUKEMTMC datasets. Our method achieves an improvement of $\sim50\%$ on both position and orientation prediction accuracy when compared to other SOTA methods.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Fair Auction and Trade Framework for Cloud VM Allocation based on Blockchain

Cloud auctions provide cost-effective strategies for cloud VM allocation. Most existing cloud auctions simply assume that the auctioneer is trustable, and thus the fairness of auctions can be easily achieved. However, in fact, such a trustable auctioneer may not exist, and the fairness is non-trivial to guarantee. In this work, for the first time, we propose a decentralized cloud VM auction and trade framework based on blockchain. We realize both auction fairness and trade fairness among participants (e.g., cloud provider and cloud users) in this system, which guarantees the interest of each party will not suffer any loss as long as it follows the protocol. Furthermore, we implement our system through the local blockchain and Ethereum official test blockchain, carry out experimental simulations, and demonstrate the feasibility of our system.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Few-Shot Learning with Intra-Class Knowledge Transfer

We consider the few-shot classification task with an unbalanced dataset, in which some classes have sufficient training samples while other classes only have limited training samples. Recent works have proposed to solve this task by augmenting the training data of the few-shot classes using generative models with the few-shot training samples as the seeds. However, due to the limited number of the few-shot seeds, the generated samples usually have small diversity, making it difficult to train a discriminative classifier for the few-shot classes. To enrich the diversity of the generated samples, we propose to leverage the intra-class knowledge from the neighbor many-shot classes with the intuition that neighbor classes share similar statistical information. Such intra-class information is obtained with a two-step mechanism. First, a regressor trained only on the many-shot classes is used to evaluate the few-shot class means from only a few samples. Second, superclasses are clustered, and the statistical mean and feature variance of each superclass are used as transferable knowledge inherited by the children few-shot classes. Such knowledge is then used by a generator to augment the sparse training data to help the downstream classification tasks. Extensive experiments show that our method achieves state-of-the-art across different datasets and $n$-shot settings.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

High Dimensional Three-Periods Locally Ideal MIP Formulations for the UC Problem

The thermal unit commitment (UC) problem often can be formulated as a mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale instances. The tighter characteristic reduces the search space, therefore, as a natural conse-quence, significantly reduces the computational burden. In the literature, many tightened formulations for single units with parts of constraints were reported without presenting how they were derived. In this paper, a sys-tematic approach is developed to formulate the tight formulations. The idea is using more new variables in high dimension space to capture all the states for single units within three periods, and then, using these state variables systematic derive three-periods locally ideal expressions for a subset of the constraints in UC. Meanwhile, the linear dependence relations of those new state variables are leveraged to keep the compactness of the obtained formulations. Based on this approach, we propose two tighter models, namely 3P-HD and 3P-HD-Pr. The proposed models and other four state-of-the-art models were tested on 51 instances, including 42 realistic instances and 9 8-unit-based instances, over a scheduling period of 24 h for systems ranging from 10 to 1080 generating units. The simulation results show that our proposed MIQP UC formulations are the tightest and can be solved most efficiently. After using piecewise technique to approxi-mate the quadratic operational cost function, the six UC MIQP formulations can be approximated by six corre-sponding mixed-integer linear programming (MILP) formulations. Our experiments show that the proposed 3P-HD and 3P-HD-Pr MILP formulations also perform the best in terms of tightness and solution times.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Inferring Vector Magnetic Fields from Stokes Profiles of GST/NIRIS Using a Convolutional Neural Network

We propose a new machine learning approach to Stokes inversion based on a convolutional neural network (CNN) and the Milne-Eddington (ME) method. The Stokes measurements used in this study were taken by the Near InfraRed Imaging Spectropolarimeter (NIRIS) on the 1.6 m Goode Solar Telescope (GST) at the Big Bear Solar Observatory. By learning the latent patterns in the training data prepared by the physics-based ME tool, the proposed CNN method is able to infer vector magnetic fields from the Stokes profiles of GST/NIRIS. Experimental results show that our CNN method produces smoother and cleaner magnetic maps than the widely used ME method. Furthermore, the CNN method is 4~6 times faster than the ME method, and is able to produce vector magnetic fields in near real-time, which is essential to space weather forecasting. Specifically, it takes ~50 seconds for the CNN method to process an image of 720 x 720 pixels comprising Stokes profiles of GST/NIRIS. Finally, the CNN-inferred results are highly correlated to the ME-calculated results and are closer to the ME&#39;s results with the Pearson product-moment correlation coefficient (PPMCC) being closer to 1 on average than those from other machine learning algorithms such as multiple support vector regression and multilayer perceptrons (MLP). In particular, the CNN method outperforms the current best machine learning method (MLP) by 2.6% on average in PPMCC according to our experimental study. Thus, the proposed physics-assisted deep learning-based CNN tool can be considered as an alternative, efficient method for Stokes inversion for high resolution polarimetric observations obtained by GST/NIRIS.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Machine Learning in Heliophysics and Space Weather Forecasting: A White Paper of Findings and Recommendations

The authors of this white paper met on 16-17 January 2020 at the New Jersey Institute of Technology, Newark, NJ, for a 2-day workshop that brought together a group of heliophysicists, data providers, expert modelers, and computer/data scientists. Their objective was to discuss critical developments and prospects of the application of machine and/or deep learning techniques for data analysis, modeling and forecasting in Heliophysics, and to shape a strategy for further developments in the field. The workshop combined a set of plenary sessions featuring invited introductory talks interleaved with a set of open discussion sessions. The outcome of the discussion is encapsulated in this white paper that also features a top-level list of recommendations agreed by participants.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

MaskFlownet: Asymmetric Feature Matching with Learnable Occlusion Mask

Feature warping is a core technique in optical flow estimation; however, the ambiguity caused by occluded areas during warping is a major problem that remains unsolved. In this paper, we propose an asymmetric occlusion-aware feature matching module, which can learn a rough occlusion mask that filters useless (occluded) areas immediately after feature warping without any explicit supervision. The proposed module can be easily integrated into end-to-end network architectures and enjoys performance gains while introducing negligible computational cost. The learned occlusion mask can be further fed into a subsequent network cascade with dual feature pyramids with which we achieve state-of-the-art performance. At the time of submission, our method, called MaskFlownet, surpasses all published optical flow methods on the MPI Sintel, KITTI 2012 and 2015 benchmarks. Code is available at https://github.com/microsoft/MaskFlownet.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

SSN: Shape Signature Networks for Multi-class Object Detection from Point Clouds

Multi-class 3D object detection aims to localize and classify objects of multiple categories from point clouds. Due to the nature of point clouds, i.e. unstructured, sparse and noisy, some features benefit-ting multi-class discrimination are underexploited, such as shape information. In this paper, we propose a novel 3D shape signature to explore the shape information from point clouds. By incorporating operations of symmetry, convex hull and chebyshev fitting, the proposed shape sig-nature is not only compact and effective but also robust to the noise, which serves as a soft constraint to improve the feature capability of multi-class discrimination. Based on the proposed shape signature, we develop the shape signature networks (SSN) for 3D object detection, which consist of pyramid feature encoding part, shape-aware grouping heads and explicit shape encoding objective. Experiments show that the proposed method performs remarkably better than existing methods on two large-scale datasets. Furthermore, our shape signature can act as a plug-and-play component and ablation study shows its effectiveness and good scalability

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Structure of minimal 2-spheres of constant curvature in the complex hyperquadric

In this paper, the singular-value decomposition theory of complex matrices is explored to study constantly curved 2-spheres minimal in both $\mathbb{C}P^n$ and the hyperquadric of $\mathbb{C}P^n$. The moduli space of all those noncongruent ones is introduced, which can be described by certain complex symmetric matrices modulo an appropriate group action. Using this description, many examples, such as constantly curved holomorphic 2-spheres of higher degree, nonhomogenous minimal 2-spheres of constant curvature, etc., are constructed. Uniqueness is proven for the totally real constantly curved 2-sphere minimal in both the hyperquadric and $\mathbb{C}P^n$.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

An optimal transport problem with backward martingale constraints motivated by insider trading

We study a single-period optimal transport problem on $\mathbb{R}^2$ with a covariance-type cost function $c(x,y) = (x_1-y_1)(x_2-y_2)$ and a backward martingale constraint. We show that a transport plan $γ$ is optimal if and only if there is a maximal monotone set $G$ that supports the $x$-marginal of $γ$ and such that $c(x,y) = \min_{z\in G}c(z,y)$ for every $(x,y)$ in the support of $γ$. We obtain sharp regularity conditions for the uniqueness of an optimal plan and for its representation in terms of a map. Our study is motivated by a variant of the classical Kyle model of insider trading from Rochet and Vila (1994).

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Numerical simulations of strong-field processes in momentum space

The time-dependent Schrodinger equation (TDSE) is usually treated in real space in the textbook. However, it makes the numerical simulations of strong-field processes difficult due to the wide dispersion and fast oscillation of the electron wave packets under the interaction of intense laser fields. Here we demonstrate that the TDSE can be efficiently solved in the momentum space. The high-order harmonic generation and above-threshold ionization spectra obtained by numerical solutions of TDSE in momentum space agree well with previous studies in real space, but significantly reducing the computation cost.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Recursive Cascaded Networks for Unsupervised Medical Image Registration

We present recursive cascaded networks, a general architecture that enables learning deep cascades, for deformable image registration. The proposed architecture is simple in design and can be built on any base network. The moving image is warped successively by each cascade and finally aligned to the fixed image; this procedure is recursive in a way that every cascade learns to perform a progressive deformation for the current warped image. The entire system is end-to-end and jointly trained in an unsupervised manner. In addition, enabled by the recursive architecture, one cascade can be iteratively applied for multiple times during testing, which approaches a better fit between each of the image pairs. We evaluate our method on 3D medical images, where deformable registration is most commonly applied. We demonstrate that recursive cascaded networks achieve consistent, significant gains and outperform state-of-the-art methods. The performance reveals an increasing trend as long as more cascades are trained, while the limit is not observed. Code is available at https://github.com/microsoft/Recursive-Cascaded-Networks.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Unsupervised 3D End-to-End Medical Image Registration with Volume Tweening Network

3D medical image registration is of great clinical importance. However, supervised learning methods require a large amount of accurately annotated corresponding control points (or morphing), which are very difficult to obtain. Unsupervised learning methods ease the burden of manual annotation by exploiting unlabeled data without supervision. In this paper, we propose a new unsupervised learning method using convolutional neural networks under an end-to-end framework, Volume Tweening Network (VTN), for 3D medical image registration. We propose three innovative technical components: (1) An end-to-end cascading scheme that resolves large displacement; (2) An efficient integration of affine registration network; and (3) An additional invertibility loss that encourages backward consistency. Experiments demonstrate that our algorithm is 880x faster (or 3.3x faster without GPU acceleration) than traditional optimization-based methods and achieves state-of-theart performance in medical image registration.

0 citations0 reviewsNo code linkedOpen access