Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
31works
0followers
25topics
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

31 published item(s)

preprint2026arXiv

In-Context Positive-Unlabeled Learning

Positive-unlabeled (PU) learning addresses binary classification when only a set of labeled positives is available alongside a pool of unlabeled samples drawn from a mixture of positives and negatives. Existing PU methods typically require dataset-specific training or iterative optimization, which limits their applicability when many tasks must be solved quickly or with little tuning. We introduce PUICL, a pretrained transformer that solves PU classification entirely through in-context learning. PUICL is pretrained on synthetic PU datasets generated from randomly instantiated structural causal models, exposing it to a wide range of feature-label relationships and class-prior configurations. At inference time, PUICL receives the labeled positives and the unlabeled samples as a single input and returns class probabilities for the unlabeled rows in one forward pass, with no gradient updates or per-task fitting. On 20 semi-synthetic PU benchmarks derived from the UCI Machine Learning Repository, OpenML, and scikit-learn, PUICL outperforms four standard PU learning baselines in average AUC and accuracy, and is competitive on F1-score. These results show that the in-context learning paradigm extends naturally beyond fully supervised tabular prediction to the semi-supervised PU setting.

preprint2026arXiv

Maximum smoothed likelihood method for the combination of multiple diagnostic tests, with application to the ROC estimation

In medical diagnostics, leveraging multiple biomarkers can significantly improve classification accuracy compared to using a single biomarker. While existing methods based on exponential tilting or density ratio models have shown promise, their assumptions may be overly restrictive in practice. In this paper, we adopt a flexible semiparametric model that relates the density ratio of diseased to healthy subjects through an unknown monotone transformation of a linear combination of biomarkers. To enhance estimation efficiency, we propose a smoothed likelihood framework that exploits the smoothness in the underlying densities and transformation function. Building on the maximum smoothed likelihood methodology, we construct estimators for the model parameters and the associated probability density functions. We develop an effective computational algorithm for implementation, derive asymptotic properties of the proposed estimators, and establish procedures for estimating the receiver operating characteristic (ROC) curve and the area under the curve (AUC). Through simulation studies and a real-data application, we demonstrate that the proposed method yields more accurate and efficient estimates than existing approaches.

preprint2026arXiv

Semiparametric inference for inequality measures under nonignorable nonresponse using callback data

This paper develops semiparametric methods for estimation and inference of widely used inequality measures when survey data are subject to nonignorable nonresponse, a challenging setting in which response probabilities depend on the unobserved outcomes. Such nonresponse mechanisms are common in household surveys and invalidate standard inference procedures due to selection bias and lack of population representativeness. We address this problem by exploiting callback data from repeated contact attempts and adopting a semiparametric model that leaves the outcome distribution unspecified. We construct semiparametric full-likelihood estimators for the underlying distribution and the associated inequality measures, and establish their large-sample properties for a broad class of functionals, including quantiles, the Theil index, and the Gini index. Explicit asymptotic variance expressions are derived, enabling valid Wald-type inference under nonignorable nonresponse. To facilitate implementation, we propose a stable and computationally convenient expectation-maximization algorithm, whose steps either admit closed-form expressions or reduce to fitting a standard logistic regression model. Simulation studies demonstrate that the proposed procedures effectively correct nonresponse bias and achieve near-benchmark efficiency. An application to Consumer Expenditure Survey data illustrates the practical gains from incorporating callback information when making inference on inequality measures.

preprint2025arXiv

The radial acceleration relation at the EDGE of galaxy formation: testing its universality in low-mass dwarf galaxies

A tight correlation between the baryonic and observed acceleration of galaxies has been reported over a wide range of mass ($10^8 < M_{\rm bar}/{\rm M}_\odot < 10^{11}$) - the Radial Acceleration Relation (RAR). This has been interpreted as evidence that dark matter is actually a manifestation of some modified weak-field gravity theory. In this paper, we study the radially resolved RAR of 12 nearby dwarf galaxies, with baryonic masses in the range $10^4 < M_{\rm bar}/{\rm M}_\odot < 10^{7.5}$, using a combination of literature data and data from the MUSE-Faint survey. We use stellar line-of-sight velocities and the Jeans modelling code GravSphere to infer the mass distributions of these galaxies, allowing us to compute the RAR. We compare the results with the EDGE simulations of isolated dwarf galaxies with similar stellar masses in a $Λ$CDM cosmology. We find that most of the observed dwarf galaxies lie systematically above the low-mass extrapolation of the RAR. Each galaxy traces a locus in the RAR space that can have a multi-valued observed acceleration for a given baryonic acceleration, while there is significant scatter from galaxy to galaxy. Our results indicate that the RAR does not apply to low-mass dwarf galaxies and that the inferred baryonic acceleration of these dwarfs does not contain enough information, on its own, to derive the observed acceleration. The simulated EDGE dwarfs behave similarly to the real data, lying systematically above the extrapolated RAR. We show that, in the context of modified weak-field gravity theories, these results cannot be explained by differential tidal forces from the Milky Way, nor by the galaxies being far from dynamical equilibrium, since none of the galaxies in our sample seems to experience strong tides. As such, our results provide further evidence for the need for invisible dark matter in the smallest dwarf galaxies.

preprint2023arXiv

A Robust Adversary Detection-Deactivation Method for Metaverse-oriented Collaborative Deep Learning

Metaverse is trending to create a digital circumstance that can transfer the real world to an online platform supported by large quantities of real-time interactions. Pre-trained Artificial Intelligence (AI) models are demonstrating their increasing capability in aiding the metaverse to achieve an excellent response with negligible delay, and nowadays, many large models are collaboratively trained by various participants in a manner named collaborative deep learning (CDL). However, several security weaknesses can threaten the safety of the CDL training process, which might result in fatal attacks to either the pre-trained large model or the local sensitive data sets possessed by an individual entity. In CDL, malicious participants can hide within the major innocent and silently uploads deceptive parameters to degenerate the model performance, or they can abuse the downloaded parameters to construct a Generative Adversarial Network (GAN) to acquire the private information of others illegally. To compensate for these vulnerabilities, this paper proposes an adversary detection-deactivation method, which can limit and isolate the access of potential malicious participants, quarantine and disable the GAN-attack or harmful backpropagation of received threatening gradients. A detailed protection analysis has been conducted on a Multiview CDL case, and results show that the protocol can effectively prevent harmful access by heuristic manner analysis and can protect the existing model by swiftly checking received gradients using only one low-cost branch with an embedded firewall.

preprint2023arXiv

Reputation-Based Federated Learning Defense to Mitigate Threats in EEG Signal Classification

This paper presents a reputation-based threat mitigation framework that defends potential security threats in electroencephalogram (EEG) signal classification during model aggregation of Federated Learning. While EEG signal analysis has attracted attention because of the emergence of brain-computer interface (BCI) technology, it is difficult to create efficient learning models for EEG analysis because of the distributed nature of EEG data and related privacy and security concerns. To address these challenges, the proposed defending framework leverages the Federated Learning paradigm to preserve privacy by collaborative model training with localized data from dispersed sources and introduces a reputation-based mechanism to mitigate the influence of data poisoning attacks and identify compromised participants. To assess the efficiency of the proposed reputation-based federated learning defense framework, data poisoning attacks based on the risk level of training data derived by Explainable Artificial Intelligence (XAI) techniques are conducted on both publicly available EEG signal datasets and the self-established EEG signal dataset. Experimental results on the poisoned datasets show that the proposed defense methodology performs well in EEG signal classification while reducing the risks associated with security threats.

preprint2023arXiv

Super cuspy dark matter halos of massive galaxies due to baryon-driven contraction

The interplay between dark matter (DM) and baryons has long been ignored when building galaxies semi-empirically and observationally. Here I show that baryonic gravity leads to an adiabatic contraction of DM halos, which is most significant in massive galaxies. Ignoring this effect, the derived DM halos are not guaranteed in dynamical equilibrium. I present a new approach to deriving DM halos from rotation curves, which incorporates the adiabatic contraction. The compressed halos turn out super cuspy with respect to NFW halos, which require smaller baryonic contributions and less concentrated primordial halos. I also examine the semi-empirical approach to building galaxies, and find the adiabatic contraction can shift massive galaxies from the observed radial acceleration relation dramatically. Both approaches lead to super cuspy DM halos for massive galaxies, demonstrating the importance of the baryon-driven contraction, which has to be taken into account in order to make an apple-to-apple comparison with simulations.

preprint2022arXiv

An Extendable Maneuver Management Framework with Fault-Tolerant Mechanism for Vehicle Platoon Control System in Highway Scenario

Vehicle platoon often face the problem of lack of scalability of maneuvers in practical applications. Once a new scenario is added, the original program may no longer be available. To deal with this problem, this paper introduces a two-dimensional maneuver management framework with a fault-tolerant mechanism on the basis of the proposed hierarchical architecture for the platoon control system. Maneuvers and roles are two dimensions, based on which the management strategies are decoupled. This makes each vehicle in the platoon has the ability to execute management strategies of various maneuvers and the new maneuver could be extended without revising the existing part. The fault-tolerant mechanism is designed as a maneuver triggered by hardware failures to keep safe before taking over. Furthermore, three typical maneuvers are selected for case studies to illustrate how the management strategies in this framework work. Finally, a comprehensive simulation scenario integrating different maneuvers is designed and a real-world implementation using micro-vehicles is conducted. Results show that the propose two-dimensional framework could effectively deal with various maneuvers and satisfy the computational real-time requirements

preprint2022arXiv

CUP: A Conservative Update Policy Algorithm for Safe Reinforcement Learning

Safe reinforcement learning (RL) is still very challenging since it requires the agent to consider both return maximization and safe exploration. In this paper, we propose CUP, a Conservative Update Policy algorithm with a theoretical safety guarantee. We derive the CUP based on the new proposed performance bounds and surrogate functions. Although using bounds as surrogate functions to design safe RL algorithms have appeared in some existing works, we develop them at least three aspects: (i) We provide a rigorous theoretical analysis to extend the surrogate functions to generalized advantage estimator (GAE). GAE significantly reduces variance empirically while maintaining a tolerable level of bias, which is an efficient step for us to design CUP; (ii) The proposed bounds are tighter than existing works, i.e., using the proposed bounds as surrogate functions are better local approximations to the objective and safety constraints. (iii) The proposed CUP provides a non-convex implementation via first-order optimizers, which does not depend on any convex approximation. Finally, extensive experiments show the effectiveness of CUP where the agent satisfies safe constraints. We have opened the source code of CUP at https://github.com/RL-boxes/Safe-RL.

preprint2022arXiv

DavarOCR: A Toolbox for OCR and Multi-Modal Document Understanding

This paper presents DavarOCR, an open-source toolbox for OCR and document understanding tasks. DavarOCR currently implements 19 advanced algorithms, covering 9 different task forms. DavarOCR provides detailed usage instructions and the trained models for each algorithm. Compared with the previous opensource OCR toolbox, DavarOCR has relatively more complete support for the sub-tasks of the cutting-edge technology of document understanding. In order to promote the development and application of OCR technology in academia and industry, we pay more attention to the use of modules that different sub-domains of technology can share. DavarOCR is publicly released at https://github.com/hikopensource/Davar-Lab-OCR.

preprint2022arXiv

Expert-Calibrated Learning for Online Optimization with Switching Costs

We study online convex optimization with switching costs, a practically important but also extremely challenging problem due to the lack of complete offline information. By tapping into the power of machine learning (ML) based optimizers, ML-augmented online algorithms (also referred to as expert calibration in this paper) have been emerging as state of the art, with provable worst-case performance guarantees. Nonetheless, by using the standard practice of training an ML model as a standalone optimizer and plugging it into an ML-augmented algorithm, the average cost performance can be highly unsatisfactory. In order to address the &#34;how to learn&#34; challenge, we propose EC-L2O (expert-calibrated learning to optimize), which trains an ML-based optimizer by explicitly taking into account the downstream expert calibrator. To accomplish this, we propose a new differentiable expert calibrator that generalizes regularized online balanced descent and offers a provably better competitive ratio than pure ML predictions when the prediction error is large. For training, our loss function is a weighted sum of two different losses -- one minimizing the average ML prediction error for better robustness, and the other one minimizing the post-calibration average cost. We also provide theoretical analysis for EC-L2O, highlighting that expert calibration can be even beneficial for the average cost performance and that the high-percentile tail ratio of the cost achieved by EC-L2O to that of the offline optimal oracle (i.e., tail cost ratio) can be bounded. Finally, we test EC-L2O by running simulations for sustainable datacenter demand response. Our results demonstrate that EC-L2O can empirically achieve a lower average cost as well as a lower competitive ratio than the existing baseline algorithms.

preprint2022arXiv

Policy Optimization with Stochastic Mirror Descent

Improving sample efficiency has been a longstanding goal in reinforcement learning. This paper proposes $\mathtt{VRMPO}$ algorithm: a sample efficient policy gradient method with stochastic mirror descent. In $\mathtt{VRMPO}$, a novel variance-reduced policy gradient estimator is presented to improve sample efficiency. We prove that the proposed $\mathtt{VRMPO}$ needs only $\mathcal{O}(ε^{-3})$ sample trajectories to achieve an $ε$-approximate first-order stationary point, which matches the best sample complexity for policy optimization. The extensive experimental results demonstrate that $\mathtt{VRMPO}$ outperforms the state-of-the-art policy gradient methods in various settings.

preprint2022arXiv

Self-localized topological states in three dimensions

Three-dimensional (3D) topological materials exhibit much richer phenomena than their lower-dimensional counterparts. Here, we propose self-localized topological states (i.e., topological solitons) in a 3D nonlinear photonic Chern insulator. Despite being in the bulk and self-localized in all 3D, the topological solitons at high-symmetry points K and K&#39; rotate in the same direction, due to the underlying topology. Specifically, under the saturable nonlinearity the solitons are stable over a broad frequency range. Our results highlight how topology and nonlinearity interact with each other and can be extended to other 3D topological systems.

preprint2022arXiv

The Effect of Adiabatic Compression on Dark Matter Halos and the Radial Acceleration Relation

We use a semi-empirical model to investigate the radial acceleration relation (RAR) in a cold dark matter (CDM) framework. Specifically, we build 80 model galaxies covering the same parameter space as the observed galaxies in the SPARC database, assigning them to dark matter halos using abundance matching and halo mass-concentration relations. We consider several abundance matching relations, finding some to be a better match to the kinematic data than others. We compute the unavoidable gravitational interactions between baryons and their dark matter halos, leading to an overall compression of the original NFW halos. Before halo compression, high-mass galaxies approximately lie on the observed RAR whereas low-mass galaxies display up-bending &#34;hooks&#34; at small radii due to DM cusps, making them deviate systematically from the observed relation. After halo compression, the initial NFW halos become more concentrated at small radii, making larger contributions to rotation curves. This increases the total accelerations, moving all model galaxies away from the observed relation. These systematic deviations suggest that the CDM model with abundance matching alone cannot explain the observed RAR. Further effects (e.g., feedback) would need to counteract the compression with precisely the right amount of halo expansion, even in high mass galaxies with deep potential wells where such effects are generally predicted to be negligible.

preprint2022arXiv

The intervelocity of galaxy pairs in $Λ$CDM -- The observed velocity peak at ~130 km/s is not unique to MOND

Observational studies of pairs of galaxies have uncovered that their differential line-of-sight velocities indicate the presence of a peak in their three-dimensional intervelocity distribution at 130-150 km/s. It had been argued that galaxy pairs in the standard model of cosmology, $Λ$CDM, should not exhibit such an intervelocity peak, while Modified Newtonian Dynamics (MOND) predicts such a preferred intervelocity for paired galaxies. However, no direct comparison with $Λ$CDM applying the same selection criteria and methodology as the observational studies has been performed yet, placing the comparison on unsure footing. To rectify this, we investigate this potential challenge for $Λ$CDM by determining whether an analog of the observed intervelocity peak is present in galaxy pairs within the IllustrisTNG-300 cosmological simulation. We identify galaxy pairs following the observational study&#39;s selection criteria, measure their projected velocity difference, and analyse both the de-projected as well as the full velocity difference for this galaxy pair sample in the simulation. We recover a deprojected intervelocity peak at ~130 km/s for galaxy pairs selected from the simulation. The full three-dimensional velocity information available for the pairs in the simulation also reveals a clear preference for this intervelocity. The intervelocity peak among galaxy pairs does not appear to be a feature unique to MOND, but is also present in $Λ$CDM. It can thus not be claimed as a unique success of either theory over the other. Developing the galaxy pair intervelocity into a test of gravity in the low acceleration regime will require more detailed studies to identify measurable differences in the models.

preprint2022arXiv

TRIE++: Towards End-to-End Information Extraction from Visually Rich Documents

Recently, automatically extracting information from visually rich documents (e.g., tickets and resumes) has become a hot and vital research topic due to its widespread commercial value. Most existing methods divide this task into two subparts: the text reading part for obtaining the plain text from the original document images and the information extraction part for extracting key contents. These methods mainly focus on improving the second, while neglecting that the two parts are highly correlated. This paper proposes a unified end-to-end information extraction framework from visually rich documents, where text reading and information extraction can reinforce each other via a well-designed multi-modal context block. Specifically, the text reading part provides multi-modal features like visual, textual and layout features. The multi-modal context block is developed to fuse the generated multi-modal features and even the prior knowledge from the pre-trained language model for better semantic representation. The information extraction part is responsible for generating key contents with the fused context features. The framework can be trained in an end-to-end trainable manner, achieving global optimization. What is more, we define and group visually rich documents into four categories across two dimensions, the layout and text type. For each document category, we provide or recommend the corresponding benchmarks, experimental settings and strong baselines for remedying the problem that this research area lacks the uniform evaluation standard. Extensive experiments on four kinds of benchmarks (from fixed layout to variable layout, from full-structured text to semi-unstructured text) are reported, demonstrating the proposed method&#39;s effectiveness. Data, source code and models are available.

preprint2022arXiv

Universal Conditional Masked Language Pre-training for Neural Machine Translation

Pre-trained sequence-to-sequence models have significantly improved Neural Machine Translation (NMT). Different from prior works where pre-trained models usually adopt an unidirectional decoder, this paper demonstrates that pre-training a sequence-to-sequence model but with a bidirectional decoder can produce notable performance gains for both Autoregressive and Non-autoregressive NMT. Specifically, we propose CeMAT, a conditional masked language model pre-trained on large-scale bilingual and monolingual corpora in many languages. We also introduce two simple but effective methods to enhance the CeMAT, aligned code-switching & masking and dynamic dual-masking. We conduct extensive experiments and show that our CeMAT can achieve significant performance improvement for all scenarios from low- to extremely high-resource languages, i.e., up to +14.4 BLEU on low resource and +7.9 BLEU improvements on average for Autoregressive NMT. For Non-autoregressive NMT, we demonstrate it can also produce consistent performance gains, i.e., up to +5.3 BLEU. To the best of our knowledge, this is the first work to pre-train a unified model for fine-tuning on both NMT tasks. Code, data, and pre-trained models are available at https://github.com/huawei-noah/Pretrained-Language-Model/tree/master/CeMAT.

preprint2021arXiv

A cautionary tale in fitting galaxy rotation curves with Bayesian techniques: does Newton&#39;s constant vary from galaxy to galaxy?

The application of Bayesian techniques to astronomical data is generally non-trivial because the fitting parameters can be strongly degenerated and the formal uncertainties are themselves uncertain. An example is provided by the contradictory claims over the presence or absence of a universal acceleration scale (g$_\dagger$) in galaxies based on Bayesian fits to rotation curves. To illustrate the situation, we present an analysis in which the Newtonian gravitational constant $G_N$ is allowed to vary from galaxy to galaxy when fitting rotation curves from the SPARC database, in analogy to $g_{\dagger}$ in the recently debated Bayesian analyses. When imposing flat priors on $G_N$, we obtain a wide distribution of $G_N$ which, taken at face value, would rule out $G_N$ as a universal constant with high statistical confidence. However, imposing an empirically motivated log-normal prior returns a virtually constant $G_N$ with no sacrifice in fit quality. This implies that the inference of a variable $G_N$ (or g$_{\dagger}$) is the result of the combined effect of parameter degeneracies and unavoidable uncertainties in the error model. When these effects are taken into account, the SPARC data are consistent with a constant $G_{\rm N}$ (and constant $g_\dagger$).

preprint2021arXiv

CARE: Commonsense-Aware Emotional Response Generation with Latent Concepts

Rationality and emotion are two fundamental elements of humans. Endowing agents with rationality and emotion has been one of the major milestones in AI. However, in the field of conversational AI, most existing models only specialize in one aspect and neglect the other, which often leads to dull or unrelated responses. In this paper, we hypothesize that combining rationality and emotion into conversational agents can improve response quality. To test the hypothesis, we focus on one fundamental aspect of rationality, i.e., commonsense, and propose CARE, a novel model for commonsense-aware emotional response generation. Specifically, we first propose a framework to learn and construct commonsense-aware emotional latent concepts of the response given an input message and a desired emotion. We then propose three methods to collaboratively incorporate the latent concepts into response generation. Experimental results on two large-scale datasets support our hypothesis and show that our model can produce more accurate and commonsense-aware emotional responses and achieve better human ratings than state-of-the-art models that only specialize in one aspect.

preprint2021arXiv

Semiparametric empirical likelihood inference with estimating equations under density ratio models

The density ratio model (DRM) provides a flexible and useful platform for combining information from multiple sources. In this paper, we consider statistical inference under two-sample DRMs with additional parameters defined through and/or additional auxiliary information expressed as estimating equations. We examine the asymptotic properties of the maximum empirical likelihood estimators (MELEs) of the unknown parameters in the DRMs and/or defined through estimating equations, and establish the chi-square limiting distributions for the empirical likelihood ratio (ELR) statistics. We show that the asymptotic variance of the MELEs of the unknown parameters does not decrease if one estimating equation is dropped. Similar properties are obtained for inferences on the cumulative distribution function and quantiles of each of the populations involved. We also propose an ELR test for the validity and usefulness of the auxiliary information. Simulation studies show that correctly specified estimating equations for the auxiliary information result in more efficient estimators and shorter confidence intervals. Two real-data examples are used for illustrations.

preprint2021arXiv

Testing the Strong Equivalence Principle: Detection of the External Field Effect in Rotationally Supported Galaxies

The strong equivalence principle (SEP) distinguishes General Relativity from other viable theories of gravity. The SEP demands that the internal dynamics of a self-gravitating system under free-fall in an external gravitational field should not depend on the external field strength. We test the SEP by investigating the external field effect (EFE) in Milgromian dynamics (MOND), proposed as an alternative to dark matter in interpreting galactic kinematics. We report a detection of this EFE using galaxies from the Spitzer Photometry and Accurate Rotation Curves (SPARC) sample together with estimates of the large-scale external gravitational field from an all-sky galaxy catalog. Our detection is threefold: (1) the EFE is individually detected at $8σ$ to $11σ$ in &#34;golden&#34; galaxies subjected to exceptionally strong external fields, while it is not detected in exceptionally isolated galaxies, (2) the EFE is statistically detected at more than $4σ$ from a blind test of 153 SPARC rotating galaxies, giving a mean value of the external field consistent with an independent estimate from the galaxies&#39; environments, and (3) we detect a systematic downward trend in the weak gravity part of the radial acceleration relation at the right acceleration predicted by the EFE of the MOND modified gravity. Tidal effects from neighboring galaxies in the $Λ$CDM context are not strong enough to explain these phenomena. They are not predicted by existing $Λ$CDM models of galaxy formation and evolution, adding a new small-scale challenge to the $Λ$CDM paradigm. Our results point to a breakdown of the SEP, supporting modified gravity theories beyond General Relativity.

preprint2020arXiv

A comprehensive catalog of dark matter halo models for SPARC galaxies

We present rotation curve fits to 175 late-type galaxies from the Spitzer Photometry & Accurate Rotation Curves (SPARC) database using seven dark matter (DM) halo profiles: pseudo-isothermal (pISO), Burkert, Navarro-Frenk-White (NFW), Einasto, Di Cintio (2014, DC14), coreNFW, and a new semi-empirical profile named Lucky13. We marginalize over stellar mass-to-light ratio, galaxy distance, disk inclination, halo concentration and halo mass (and an additional shape parameter for Einasto) using a Markov Chain Monte Carlo method. We find that cored halo models such as the DC14 and Burkert profiles generally provide better fits to rotation curves than the cuspy NFW profile. The stellar mass-halo mass relation from abundance matching is recovered by all halo profiles once imposed as a Bayesian prior, whereas the halo mass-concentration relation is not reproduced in detail by any halo model. We provide an extensive set of figures as well as best-fit parameters in machine-readable tables to facilitate model comparison and the exploration of DM halo properties.

preprint2020arXiv

A selective review on calibration information from similar studies based on parametric likelihood or empirical likelihood

In multi-center clinical trials, due to various reasons, the individual-level data are strictly restricted to be assessed publicly. Instead, the summarized information is widely available from published results. With the advance of computational technology, it has become very common in data analyses to run on hundreds or thousands of machines simultaneous, with the data distributed across those machines and no longer available in a single central location. How to effectively assemble the summarized clinical data information or information from each machine in parallel computation has become a challenging task for statisticians and computer scientists. In this paper, we selectively review some recently-developed statistical methods, including communication efficient distributed statistical inference, and renewal estimation and incremental inference, which can be regarded as the latest development of calibration information methods in the era of big data. Even though those methods were developed in different fields and in different statistical frameworks, in principle, they are asymptotically equivalent to those well known methods developed in meta analysis. Almost no or little information is lost compared with the case when full data are available. As a general tool to integrate information, we also review the generalized method of moments and estimating equations approach by using empirical likelihood method.

preprint2020arXiv

Improving Relation Extraction with Knowledge-attention

While attention mechanisms have been proven to be effective in many NLP tasks, majority of them are data-driven. We propose a novel knowledge-attention encoder which incorporates prior knowledge from external lexical resources into deep neural networks for relation extraction task. Furthermore, we present three effective ways of integrating knowledge-attention with self-attention to maximize the utilization of both knowledge and data. The proposed relation extraction system is end-to-end and fully attention-based. Experiment results show that the proposed knowledge-attention mechanism has complementary strengths with self-attention, and our integrated models outperform existing CNN, RNN, and self-attention based models. State-of-the-art performance is achieved on TACRED, a complex and large-scale relation extraction dataset.

preprint2020arXiv

Multi-person 3D Pose Estimation in Crowded Scenes Based on Multi-View Geometry

Epipolar constraints are at the core of feature matching and depth estimation in current multi-person multi-camera 3D human pose estimation methods. Despite the satisfactory performance of this formulation in sparser crowd scenes, its effectiveness is frequently challenged under denser crowd circumstances mainly due to two sources of ambiguity. The first is the mismatch of human joints resulting from the simple cues provided by the Euclidean distances between joints and epipolar lines. The second is the lack of robustness from the naive formulation of the problem as a least squares minimization. In this paper, we depart from the multi-person 3D pose estimation formulation, and instead reformulate it as crowd pose estimation. Our method consists of two key components: a graph model for fast cross-view matching, and a maximum a posteriori (MAP) estimator for the reconstruction of the 3D human poses. We demonstrate the effectiveness and superiority of our proposed method on four benchmark datasets.

preprint2020arXiv

Semiparametric Inference of the Youden Index and the Optimal Cutoff Point under Density Ratio Models

The Youden index is a popular summary statistic for receiver operating characteristic curve. It gives the optimal cutoff point of a biomarker to distinguish the diseased and healthy individuals. In this paper, we propose to model the distributions of a biomarker for individuals in the healthy and diseased groups via a semiparametric density ratio model. Based on this model, we use the maximum empirical likelihood method to estimate the Youden index and the optimal cutoff point. We further establish the asymptotic normality of the proposed estimators and construct valid confidence intervals for the Youden index and the corresponding optimal cutoff point. The proposed method automatically covers both cases when there is no lower limit of detection (LLOD) and when there is a fixed and finite LLOD for the biomarker. Extensive simulation studies and a real data example are used to illustrate the effectiveness of the proposed method and its advantages over the existing methods.

preprint2020arXiv

Symmetry breaking of spatial Kerr solitons in fractional dimension

We study symmetry breaking of solitons in the framework of a nonlinear fractional Schrödinger equation (NLFSE), characterized by its Lévy index, with cubic nonlinearity and a symmetric double-well potential. Asymmetric, symmetric, and antisymmetric soliton solutions are found, with stable asymmetric soliton solutions emerging from unstable symmetric and antisymmetric ones by way of symmetry-breaking bifurcations. Two different bifurcation scenarios are possible. First, symmetric soliton solutions undergo a symmetry-breaking bifurcation of the pitchfork type, which gives rise to a branch of asymmetric solitons, under the action of the self-focusing nonlinearity. Second, a family of asymmetric solutions branches off from antisymmetric states in the case of self-defocusing nonlinearity through a bifurcation of an inverted-pitchfork type. Systematic numerical analysis demonstrates that increase of the Lévy index leads to shrinkage or expansion of the symmetry-breaking region, depending on parameters of the double-well potential. Stability of the soliton solutions is explored following the variation of the Lévy index, and the results are confirmed by direct numerical simulations.

preprint2020arXiv

Towards Reducing Severe Defocus Spread Effects for Multi-Focus Image Fusion via an Optimization Based Strategy

Multi-focus image fusion (MFF) is a popular technique to generate an all-in-focus image, where all objects in the scene are sharp. However, existing methods pay little attention to defocus spread effects of the real-world multi-focus images. Consequently, most of the methods perform badly in the areas near focus map boundaries. According to the idea that each local region in the fused image should be similar to the sharpest one among source images, this paper presents an optimization-based approach to reduce defocus spread effects. Firstly, a new MFF assessmentmetric is presented by combining the principle of structure similarity and detected focus maps. Then, MFF problem is cast into maximizing this metric. The optimization is solved by gradient ascent. Experiments conducted on the real-world dataset verify superiority of the proposed model. The codes are available at https://github.com/xsxjtu/MFF-SSIM.

preprint2020arXiv

Vortex solitons in fractional nonlinear Schrödinger equation with the cubic-quintic nonlinearity

We address the existence and stability of vortex-soliton (VS) solutions of the fractional nonlinear Schrödinger equation (NLSE) with competing cubic-quintic nonlinearities and the Lévy index (fractionality) taking values 1 \leqα\leq2. Families of ring-shaped VSs with vorticities s = 1,2, and 3 are constructed in a numerical form. Unlike the usual two-dimensional NLSE (which corresponds to α = 2), in the fractional model VSs exist above a finite threshold value of the total power,P. Stability of the VS solutions is investigated for small perturbations governed by the linearized equation, and corroborated by direct simulations. Unstable VSs are broken up by azimuthal perturbations into several fragments, whose number is determined by the fastest growing eigenmode of small perturbations. The stability region, defined in terms of P, expands with the increase of α from 1 up to 2 for all s = 1, 2, and 3, except for steep shrinkage for s = 2 in the interval of 1\leqα\leq1.3.

preprint2019arXiv

The halo mass function of late-type galaxies from HI kinematics

We present an empirical method to measure the halo mass function (HMF) of galaxies. We determine the relation between the \hi\ line-width from single-dish observations and the dark matter halo mass ($M_{200}$) inferred from rotation curve fits in the SPARC database, then we apply this relation to galaxies from the \hi\ Parkes All Sky Survey (HIPASS) to derive the HMF. This empirical HMF is well fit by a Schecther function, and matches that expected in $Λ$CDM over the range $10^{10.5} < M_{200} < 10^{12}\;\mathrm{M}_{\odot}$. More massive halos must be poor in neutral gas to maintain consistency with the power law predicted by $Λ$CDM. We detect no discrepancy at low masses. The lowest halo mass probed by HIPASS, however, is just greater than the mass scale where the Local Group missing satellite problem sets in. The integrated mass density associated with the dark matter halos of \hi-detected galaxies sums to $Ω_{\rm m,gal} \approx 0.03$ over the probed mass range.