Trust snapshot

Quick read

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

32 published item(s)

preprint2026arXiv

Discovering Physical Directions in Weight Space: Composing Neural PDE Experts

Recent advances in neural operators have made partial differential equation (PDE) surrogate modeling increasingly scalable and transferable through large-scale pretraining and in-context adaptation. However, after a shared operator is fine-tuned to multiple regimes within a continuous physical family, it remains unclear whether the resulting weight-space updates merely form isolated regime experts or reveal reusable physical structure. Starting from a shared family anchor, we fine-tune low- and high-regime endpoint experts and show that their updates can be separated into a family-shared adaptation and a direction aligned with the underlying physical parameter. This separation reinterprets endpoint experts as finite-difference probes of a local physical direction in weight space, explaining why static averaging can interpolate between regimes but attenuates endpoint-specific physics. Building on this perspective, we propose Calibration-Conditioned Merge (CCM), a post-hoc coordinate readout method for composing neural PDE experts along this physical direction. Given physical metadata, a calibrated coordinate mapping, or a short observed rollout prefix, CCM infers the target composition coordinate and deploys a single merged checkpoint for the remaining rollout. We evaluate CCM on the reaction--diffusion system, viscosity-parameterized two-dimensional Navier--Stokes equations, and radial dam-break dynamics. Across these benchmarks, CCM achieves its strongest gains in extrapolative regimes, reducing out-of-distribution rollout error relative to the family anchor by 54.2%, 42.8%, and 13.8%, respectively. Further experiments across FNO scales, a DPOT-style backbone, and ablations confirm that endpoint fine-tuning is not arbitrary checkpoint drift, but reveals a calibratable physical direction for training-free transfer across PDE regimes.

preprint2022arXiv

Abundance of observable Lyapunov irregular sets

Lyapunov exponent is widely used in natural science to find chaotic signal, but its existence is seldom discussed. In the present paper, we consider the problem of whether the set of points at which Lyapunov exponent fails to exist, called the Lyapunov irregular set, has positive Lebesgue measure. The only known example with the Lyapunov irregular set of positive Lebesgue measure is a figure-8 attractor by the work of Ott and Yorke [OY2008], whose key mechanism (homoclinic loop) is easy to be broken by small perturbations. In this paper, we show that surface diffeomorphisms with a robust homoclinic tangency given by Colli and Vargas [CV2001], as well as other several known nonhyperbolic dynamics, has the Lyapunov irregular set of positive Lebesgue measure. We can construct such positive Lebesgue measure sets both as the time averages exist and do not exist on it.

preprint2022arXiv

From Data to Software to Science with the Rubin Observatory LSST

The Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST) dataset will dramatically alter our understanding of the Universe, from the origins of the Solar System to the nature of dark matter and dark energy. Much of this research will depend on the existence of robust, tested, and scalable algorithms, software, and services. Identifying and developing such tools ahead of time has the potential to significantly accelerate the delivery of early science from LSST. Developing these collaboratively, and making them broadly available, can enable more inclusive and equitable collaboration on LSST science. To facilitate such opportunities, a community workshop entitled "From Data to Software to Science with the Rubin Observatory LSST" was organized by the LSST Interdisciplinary Network for Collaboration and Computing (LINCC) and partners, and held at the Flatiron Institute in New York, March 28-30th 2022. The workshop included over 50 in-person attendees invited from over 300 applications. It identified seven key software areas of need: (i) scalable cross-matching and distributed joining of catalogs, (ii) robust photometric redshift determination, (iii) software for determination of selection functions, (iv) frameworks for scalable time-series analyses, (v) services for image access and reprocessing at scale, (vi) object image access (cutouts) and analysis at scale, and (vii) scalable job execution systems. This white paper summarizes the discussions of this workshop. It considers the motivating science use cases, identified cross-cutting algorithms, software, and services, their high-level technical specifications, and the principles of inclusive collaborations needed to develop them. We provide it as a useful roadmap of needs, as well as to spur action and collaboration between groups and individuals looking to develop reusable software for early LSST science.

preprint2022arXiv

Manifolds with $4\frac{1}{2}$-positive curvature operator of the second kind

We show that a closed four-manifold with $4\frac{1}{2}$-positive curvature operator of the second kind is diffeomorphic to a spherical space form. The curvature assumption is sharp as both $\mathbb{CP}^2$ and $\mathbb{S}^3 \times \mathbb{S}^1$ have $4\frac{1}{2}$-nonnegative curvature operator of the second kind. In higher dimensions $n\geq 5$, we show that closed Riemannian manifolds with $4\frac{1}{2}$-positive curvature operator of the second kind are homeomorphic to spherical space forms. These results are proved by showing that $4\frac{1}{2}$-positive curvature operator of the second kind implies both positive isotropic curvature and positive Ricci curvature. Rigidity results for $4\frac{1}{2}$-nonnegative curvature operator of the second kind are also obtained.

preprint2022arXiv

Rubin Observatory LSST Transients and Variable Stars Roadmap

The Vera C. Rubin Legacy Survey of Space and Time holds the potential to revolutionize time domain astrophysics, reaching completely unexplored areas of the Universe and mapping variability time scales from minutes to a decade. To prepare to maximize the potential of the Rubin LSST data for the exploration of the transient and variable Universe, one of the four pillars of Rubin LSST science, the Transient and Variable Stars Science Collaboration, one of the eight Rubin LSST Science Collaborations, has identified research areas of interest and requirements, and paths to enable them. While our roadmap is ever-evolving, this document represents a snapshot of our plans and preparatory work in the final years and months leading up to the survey's first light.

preprint2022arXiv

The second Robin eigenvalue in non-compact rank-1 symmetric spaces

In this paper, we prove a quantitative spectral inequality for the second Robin eigenvalue in non-compact rank-1 symmetric spaces. In particular, this shows that for bounded domains in non-compact rank-1 symmetric spaces, the geodesic ball maximises the second Robin eigenvalue among domains of the same volume, with negative Robin parameter in the regime connecting the first nontrivial Neumann and Steklov eigenvalues. This result generalises the work of Freitas and Laugesen in the Euclidean setting [FL21] as well as our previous work in the hyperbolic space [LWW20].

preprint2022arXiv

Toward automated detection of light echoes in synoptic surveys: considerations on the application of the Deep Convolutional Neural Networks

Light Echoes (LEs) are the reflections of astrophysical transients off of interstellar dust. They are fascinating astronomical phenomena that enable studies of the scattering dust as well as of the original transients. LEs, however, are rare and extremely difficult to detect as they appear as faint, diffuse, time-evolving features. The detection of LEs still largely relies on human inspection of images, a method unfeasible in the era of large synoptic surveys. The Vera C. Rubin Observatory Legacy Survey of Space and Time, LSST, will generate an unprecedented amount of astronomical imaging data at high spatial resolution, exquisite image quality, and over tens of thousands of square degrees of sky: an ideal survey for LEs. However, the Rubin data processing pipelines are optimized for the detection of point-sources and will entirely miss LEs. Over the past several years, Artificial Intelligence (AI) object detection frameworks have achieved and surpassed real-time, human-level performance. In this work, we prepare a dataset from the ATLAS telescope and test a popular AI object detection framework, You Only Look Once, or YOLO, developed in the computer vision community, to demonstrate the potential of AI in the detection of LEs in astronomical images. We find that an AI framework can reach human-level performance even with a size- and quality-limited dataset. We explore and highlight challenges, including class imbalance and label incompleteness, and roadmap the work required to build an end-to-end pipeline for the automated detection and study of LEs in high-throughput astronomical surveys.

preprint2021arXiv

Optimizing Cadences with Realistic Light Curve Filtering for Serendipitous Kilonova Discovery with Vera Rubin Observatory

Current and future optical and near-infrared wide-field surveys have the potential of finding kilonovae, the optical and infrared counterparts to neutron star mergers, independently of gravitational-wave or high-energy gamma-ray burst triggers. The ability to discover fast and faint transients such as kilonovae largely depends on the area observed, the depth of those observations, the number of re-visits per field in a given time frame, and the filters adopted by the survey; it also depends on the ability to perform rapid follow-up observations to confirm the nature of the transients. In this work, we assess kilonova detectability in existing simulations of the LSST strategy for the Vera C. Rubin Wide Fast Deep survey, with focus on comparing rolling to baseline cadences. Although currently available cadences can enable the detection of more than 300 kilonovae out to 1400 Mpc over the ten-year survey, we can expect only 3-32 kilonovae similar to GW170817 to be recognizable as fast-evolving transients. We also explore the detectability of kilonovae over the plausible parameter space, focusing on viewing angle and ejecta masses. We find that observations in redder izy bands are crucial for identification of nearby (within 300 Mpc) kilonovae that could be spectroscopically classified more easily than more distant sources. Rubin's potential for serendipitous kilonova discovery could be increased by gain of efficiency with the employment of individual 30s exposures (as opposed to 2x15s snap pairs), with the addition of red-band observations coupled with same-night observations in g- or r-bands, and possibly with further development of a new rolling-cadence strategy.

preprint2021arXiv

Preparing to discover the unknown with Rubin LSST -- I: Time domain

Perhaps the most exciting promise of the Rubin Observatory Legacy Survey of Space and Time (LSST) is its capability to discover phenomena never before seen or predicted from theory: true astrophysical novelties, but the ability of LSST to make these discoveries will depend on the survey strategy. Evaluating candidate strategies for true novelties is a challenge both practically and conceptually: unlike traditional astrophysical tracers like supernovae or exoplanets, for anomalous objects the template signal is by definition unknown. We present our approach to solve this problem, by assessing survey completeness in a phase space defined by object color, flux (and their evolution), and considering the volume explored by integrating metrics within this space with the observation depth, survey footprint, and stellar density. With these metrics, we explore recent simulations of the Rubin LSST observing strategy across the entire observed footprint and in specific regions in the Local Volume: the Galactic Plane and Magellanic Clouds. Under our metrics, observing strategies with greater diversity of exposures and time gaps tend to be more sensitive to genuinely new phenomena, particularly over time-gap ranges left relatively unexplored by previous surveys. To assist the community, we have made all the tools developed publicly available. Extension of the scheme to include proper motions and the detection of associations or populations of interest, will be communicated in paper II of this series. This paper was written with the support of the Vera C. Rubin LSST Transients and Variable Stars and Stars, Milky Way, Local Volume Science Collaborations.

preprint2021arXiv

Super exponential divergence of periodic points for C^1-generic partially hyperbolic homoclinic classes

A diffeomorphism f is called super exponential divergent if for every r>1, the lower limit of #Per_n(f)/r^n diverges to infinity as n tends to infinity, where Per_n(f) is the set of all periodic points of f with period n. This property is stronger than the usual super exponential growth of the number of periodic points. We show that for a three dimensional manifold M, there exists an open subset O of Diff^1(M) such that diffeomorphisms with super exponential divergent property form a dense subset of O in the C^1-topology. A relevant result of non super exponential divergence for diffeomorphisms in a locally generic subset of Diff^r(M) (r=1,2,...\infty) is also shown.

preprint2020arXiv

A Time Attention based Fraud Transaction Detection Framework

With online payment platforms being ubiquitous and important, fraud transaction detection has become the key for such platforms, to ensure user account safety and platform security. In this work, we present a novel method for detecting fraud transactions by leveraging patterns from both users' static profiles and users' dynamic behaviors in a unified framework. To address and explore the information of users' behaviors in continuous time spaces, we propose to use \emph{time attention based recurrent layers} to embed the detailed information of the time interval, such as the durations of specific actions, time differences between different actions and sequential behavior patterns,etc., in the same latent space. We further combine the learned embeddings and users' static profiles altogether in a unified framework. Extensive experiments validate the effectiveness of our proposed methods over state-of-the-art methods on various evaluation metrics, especially on \emph{recall at top percent} which is an important metric for measuring the balance between service experiences and risk of potential losses.

preprint2020arXiv

An upper bound for the first nonzero Steklov eigenvalue

Let $(M^n,g)$ be a complete simply connected $n$-dimensional Riemannian manifold with curvature bounds $\operatorname{Sect}_g\leq κ$ for $κ\leq 0$ and $\operatorname{Ric}_g\geq(n-1)Kg$ for $K\leq 0$. We prove that for any bounded domain $Ω\subset M^n$ with diameter $d$ and Lipschitz boundary, if $Ω^*$ is a geodesic ball in the simply connected space form with constant sectional curvature $κ$ enclosing the same volume as $Ω$, then $σ_1(Ω) \leq C σ_1(Ω^*)$, where $σ_1(Ω)$ and $ σ_1(Ω^*)$ denote the first nonzero Steklov eigenvalues of $Ω$ and $Ω^*$ respectively, and $C=C(n,κ, K, d)$ is an explicit constant. When $κ=K$, we have $C=1$ and recover the Brock-Weinstock inequality, asserting that geodesic balls uniquely maximize the first nonzero Steklov eigenvalue among domains of the same volume, in Euclidean space and the hyperbolic space.

preprint2020arXiv

Ancient solutions to the Ricci flow in higher dimensions

In this paper, we study $κ$-noncollapsed ancient solutions to the Ricci flow with nonnegative curvature operator in higher dimensions. We impose one further assumption: one of the asymptotic shrinking gradient Ricci solitons is the standard cylinder $\mathbb{S}^{n-1}\times\mathbb{R}$. By making use of the properties of such ancient solutions, we generalize part one of Brendle \cite{brendle2018ancient} to higher dimensions, that is, every noncompact $κ$-noncollapsed rotationally symmetric ancient solution to the Ricci flow with bounded positive curvature operator must be the Bryant soliton.

preprint2020arXiv

Category-Level Articulated Object Pose Estimation

This project addresses the task of category-level pose estimation for articulated objects from a single depth image. We present a novel category-level approach that correctly accommodates object instances previously unseen during training. We introduce Articulation-aware Normalized Coordinate Space Hierarchy (ANCSH) - a canonical representation for different articulated objects in a given category. As the key to achieve intra-category generalization, the representation constructs a canonical object space as well as a set of canonical part spaces. The canonical object space normalizes the object orientation,scales and articulations (e.g. joint parameters and states) while each canonical part space further normalizes its part pose and scale. We develop a deep network based on PointNet++ that predicts ANCSH from a single depth point cloud, including part segmentation, normalized coordinates, and joint parameters in the canonical object space. By leveraging the canonicalized joints, we demonstrate: 1) improved performance in part pose and scale estimations using the induced kinematic constraints from joints; 2) high accuracy for joint parameter estimation in camera space.

preprint2020arXiv

Distributed Deep Forest and its Application to Automatic Detection of Cash-out Fraud

Internet companies are facing the need for handling large-scale machine learning applications on a daily basis and distributed implementation of machine learning algorithms which can handle extra-large scale tasks with great performance is widely needed. Deep forest is a recently proposed deep learning framework which uses tree ensembles as its building blocks and it has achieved highly competitive results on various domains of tasks. However, it has not been tested on extremely large scale tasks. In this work, based on our parameter server system, we developed the distributed version of deep forest. To meet the need for real-world tasks, many improvements are introduced to the original deep forest model, including MART (Multiple Additive Regression Tree) as base learners for efficiency and effectiveness consideration, the cost-based method for handling prevalent class-imbalanced data, MART based feature selection for high dimension data and different evaluation metrics for automatically determining of the cascade level. We tested the deep forest model on an extra-large scale task, i.e., automatic detection of cash-out fraud, with more than 100 millions of training samples. Experimental results showed that the deep forest model has the best performance according to the evaluation metrics from different perspectives even with very little effort for parameter tuning. This model can block fraud transactions in a large amount of money each day. Even compared with the best-deployed model, the deep forest model can additionally bring into a significant decrease in economic loss each day.

preprint2020arXiv

Heterogeneous Graph Neural Networks for Malicious Account Detection

We present, GEM, the first heterogeneous graph neural network approach for detecting malicious accounts at Alipay, one of the world's leading mobile cashless payment platform. Our approach, inspired from a connected subgraph approach, adaptively learns discriminative embeddings from heterogeneous account-device graphs based on two fundamental weaknesses of attackers, i.e. device aggregation and activity aggregation. For the heterogeneous graph consists of various types of nodes, we propose an attention mechanism to learn the importance of different types of nodes, while using the sum operator for modeling the aggregation patterns of nodes in each type. Experiments show that our approaches consistently perform promising results compared with competitive methods over time.

preprint2020arXiv

How Much Can A Retailer Sell? Sales Forecasting on Tmall

Time-series forecasting is an important task in both academic and industry, which can be applied to solve many real forecasting problems like stock, water-supply, and sales predictions. In this paper, we study the case of retailers' sales forecasting on Tmall|the world's leading online B2C platform. By analyzing the data, we have two main observations, i.e., sales seasonality after we group different groups of retails and a Tweedie distribution after we transform the sales (target to forecast). Based on our observations, we design two mechanisms for sales forecasting, i.e., seasonality extraction and distribution transformation. First, we adopt Fourier decomposition to automatically extract the seasonalities for different categories of retailers, which can further be used as additional features for any established regression algorithms. Second, we propose to optimize the Tweedie loss of sales after logarithmic transformations. We apply these two mechanisms to classic regression models, i.e., neural network and Gradient Boosting Decision Tree, and the experimental results on Tmall dataset show that both mechanisms can significantly improve the forecasting results.

preprint2020arXiv

Local Contextual Attention with Hierarchical Structure for Dialogue Act Recognition

Dialogue act recognition is a fundamental task for an intelligent dialogue system. Previous work models the whole dialog to predict dialog acts, which may bring the noise from unrelated sentences. In this work, we design a hierarchical model based on self-attention to capture intra-sentence and inter-sentence information. We revise the attention distribution to focus on the local and contextual semantic information by incorporating the relative position information between utterances. Based on the found that the length of dialog affects the performance, we introduce a new dialog segmentation mechanism to analyze the effect of dialog length and context padding length under online and offline settings. The experiment shows that our method achieves promising performance on two datasets: Switchboard Dialogue Act and DailyDialog with the accuracy of 80.34\% and 85.81\% respectively. Visualization of the attention weights shows that our method can learn the context dependency between utterances explicitly.

preprint2020arXiv

Long Short-Term Sample Distillation

In the past decade, there has been substantial progress at training increasingly deep neural networks. Recent advances within the teacher--student training paradigm have established that information about past training updates show promise as a source of guidance during subsequent training steps. Based on this notion, in this paper, we propose Long Short-Term Sample Distillation, a novel training policy that simultaneously leverages multiple phases of the previous training process to guide the later training updates to a neural network, while efficiently proceeding in just one single generation pass. With Long Short-Term Sample Distillation, the supervision signal for each sample is decomposed into two parts: a long-term signal and a short-term one. The long-term teacher draws on snapshots from several epochs ago in order to provide steadfast guidance and to guarantee teacher--student differences, while the short-term one yields more up-to-date cues with the goal of enabling higher-quality updates. Moreover, the teachers for each sample are unique, such that, overall, the model learns from a very diverse set of teachers. Comprehensive experimental results across a range of vision and NLP tasks demonstrate the effectiveness of this new training method.

preprint2020arXiv

Modulus of Continuity Estimates for Fully Nonlinear Parabolic Equations

We prove that the moduli of continuity of viscosity solutions to fully nonlinear parabolic partial differential equations are viscosity subsolutions of suitable parabolic equations of one space variable. As applications, we obtain sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations with bounded initial data, via comparison with one-dimensional solutions. This work extends multiple results of Andrews and Clutterbuck for quasilinear equations to fully nonlinear equations.

preprint2020arXiv

NetDP: An Industrial-Scale Distributed Network Representation Framework for Default Prediction in Ant Credit Pay

Ant Credit Pay is a consumer credit service in Ant Financial Service Group. Similar to credit card, loan default is one of the major risks of this credit product. Hence, effective algorithm for default prediction is the key to losses reduction and profits increment for the company. However, the challenges facing in our scenario are different from those in conventional credit card service. The first one is scalability. The huge volume of users and their behaviors in Ant Financial requires the ability to process industrial-scale data and perform model training efficiently. The second challenges is the cold-start problem. Different from the manual review for credit card application in conventional banks, the credit limit of Ant Credit Pay is automatically offered to users based on the knowledge learned from big data. However, default prediction for new users is suffered from lack of enough credit behaviors. It requires that the proposal should leverage other new data source to alleviate the cold-start problem. Considering the above challenges and the special scenario in Ant Financial, we try to incorporate default prediction with network information to alleviate the cold-start problem. In this paper, we propose an industrial-scale distributed network representation framework, termed NetDP, for default prediction in Ant Credit Pay. The proposal explores network information generated by various interaction between users, and blends unsupervised and supervised network representation in a unified framework for default prediction problem. Moreover, we present a parameter-server-based distributed implement of our proposal to handle the scalability challenge. Experimental results demonstrate the effectiveness of our proposal, especially in cold-start problem, as well as the efficiency for industrial-scale dataset.

preprint2020arXiv

On a class of quasilinear operators on smooth metric measure spaces

We derive sharp estimates on the modulus of continuity for solutions of a large class of quasilinear isotropic parabolic equations on smooth metric measure spaces (with Dirichlet or Neumann boundary condition in case the boundary is non-empty). We also derive optimal lower bounds for the first Dirichlet eigenvalue of a class of homogeneous quasilinear operators, which include non-variational operators. The main feature is that this class of operators have corresponding one-dimensional operators, which allow sharp comparisons with solutions of one-dimensional equations.

preprint2020arXiv

On the second Robin eigenvalue of the Laplacian

We study the Robin eigenvalue problem for the Laplace-Beltrami operator on Riemannian manifolds. Our first result is a comparison theorem for the second Robin eigenvalue on geodesic balls in manifolds whose sectional curvatures are bounded from above. Our second result asserts that geodesic balls in nonpositively curved space forms maximize the second Robin eigenvalue among bounded domains of the same volume.

preprint2020arXiv

Privacy Preserving Point-of-interest Recommendation Using Decentralized Matrix Factorization

Points of interest (POI) recommendation has been drawn much attention recently due to the increasing popularity of location-based networks, e.g., Foursquare and Yelp. Among the existing approaches to POI recommendation, Matrix Factorization (MF) based techniques have proven to be effective. However, existing MF approaches suffer from two major problems: (1) Expensive computations and storages due to the centralized model training mechanism: the centralized learners have to maintain the whole user-item rating matrix, and potentially huge low rank matrices. (2) Privacy issues: the users' preferences are at risk of leaking to malicious attackers via the centralized learner. To solve these, we present a Decentralized MF (DMF) framework for POI recommendation. Specifically, instead of maintaining all the low rank matrices and sensitive rating data for training, we propose a random walk based decentralized training technique to train MF models on each user's end, e.g., cell phone and Pad. By doing so, the ratings of each user are still kept on one's own hand, and moreover, decentralized learning can be taken as distributed learning with multi-learners (users), and thus alleviates the computation and storage issue. Experimental results on two real-world datasets demonstrate that, comparing with the classic and state-of-the-art latent factor models, DMF significantly improvements the recommendation performance in terms of precision and recall.

preprint2020arXiv

RNE: A Scalable Network Embedding for Billion-scale Recommendation

Nowadays designing a real recommendation system has been a critical problem for both academic and industry. However, due to the huge number of users and items, the diversity and dynamic property of the user interest, how to design a scalable recommendation system, which is able to efficiently produce effective and diverse recommendation results on billion-scale scenarios, is still a challenging and open problem for existing methods. In this paper, given the user-item interaction graph, we propose RNE, a data-efficient Recommendation-based Network Embedding method, to give personalized and diverse items to users. Specifically, we propose a diversity- and dynamics-aware neighbor sampling method for network embedding. On the one hand, the method is able to preserve the local structure between the users and items while modeling the diversity and dynamic property of the user interest to boost the recommendation quality. On the other hand the sampling method can reduce the complexity of the whole method theoretically to make it possible for billion-scale recommendation. We also implement the designed algorithm in a distributed way to further improves its scalability. Experimentally, we deploy RNE on a recommendation scenario of Taobao, the largest E-commerce platform in China, and train it on a billion-scale user-item graph. As is shown on several online metrics on A/B testing, RNE is able to achieve both high-quality and diverse results compared with CF-based methods. We also conduct the offline experiments on Pinterest dataset comparing with several state-of-the-art recommendation methods and network embedding methods. The results demonstrate that our method is able to produce a good result while runs much faster than the baseline methods.

preprint2020arXiv

Sharp lower bound for the first eigenvalue of the Weighted $p$-Laplacian II

Combined with our previous work \cite{LW19eigenvalue}, we prove sharp lower bound estimates for the first nonzero eigenvalue of the weighted $p$-Laplacian with $1< p< \infty$ on a compact Bakry-Émery manifold $(M^n,g,f)$, without boundary or with a convex boundary and Neumann boundary condition, satisfying $\text{Ric}+\nabla^2 f \geq κ\, g$ for some $κ\in \mathbb{R}$.

preprint2020arXiv

Uncovering Insurance Fraud Conspiracy with Network Learning

Fraudulent claim detection is one of the greatest challenges the insurance industry faces. Alibaba&#39;s return-freight insurance, providing return-shipping postage compensations over product return on the e-commerce platform, receives thousands of potentially fraudulent claims every day. Such deliberate abuse of the insurance policy could lead to heavy financial losses. In order to detect and prevent fraudulent insurance claims, we developed a novel data-driven procedure to identify groups of organized fraudsters, one of the major contributions to financial losses, by learning network information. In this paper, we introduce a device-sharing network among claimants, followed by developing an automated solution for fraud detection based on graph learning algorithms, to separate fraudsters from regular customers and uncover groups of organized fraudsters. This solution applied at Alibaba achieves more than 80% precision while covering 44% more suspicious accounts compared with a previously deployed rule-based classifier after human expert investigations. Our approach can easily and effectively generalizes to other types of insurance.

preprint2020arXiv

Unpack Local Model Interpretation for GBDT

A gradient boosting decision tree (GBDT), which aggregates a collection of single weak learners (i.e. decision trees), is widely used for data mining tasks. Because GBDT inherits the good performance from its ensemble essence, much attention has been drawn to the optimization of this model. With its popularization, an increasing need for model interpretation arises. Besides the commonly used feature importance as a global interpretation, feature contribution is a local measure that reveals the relationship between a specific instance and the related output. This work focuses on the local interpretation and proposes an unified computation mechanism to get the instance-level feature contributions for GBDT in any version. Practicality of this mechanism is validated by the listed experiments as well as applications in real industry scenarios.

preprint2019arXiv

Freeform microfluidic networks encapsulated in laser printed three-dimensional macro-scale glass objects

Large-scale microfluidic microsystems with complex three-dimensional (3D) configurations are highly in demand by both fundamental research and industrial application, holding the potentials for fostering a wide range of innovative applications such as lab-on-a-chip and organ-on-a-chip as well as continuous-flow manufacturing of fine chemicals. However, freeform fabrication of such systems remains challenging for most of the current fabrication techniques in terms of fabrication resolution, flexibility, and achievable footprint size. Here, we report ultrashort pulse laser microfabrication of freeform microfluidic circuits with high aspect ratios and tunable diameters embedded in 3D printed glass objects. We achieve uniform microfluidic channel diameter by carefully distributing a string of extra access ports along the microfluidic channels for avoiding the over-etching in the thin microfluidic channels. After the chemical etching is completed, the extra access ports are sealed using carbon dioxide laser induced localized glass melting. We demonstrate a model hand of fused silica with a size of ~3 cm * 2.7 cm * 1.1 cm in which the whole blood vessel system is encapsulated.

preprint2018arXiv

Polarization-insensitive space-selective etching in fused silica induced by picosecond laser irradiation

It is well known that when the fused silica is irradiated with focused femtosecond laser beams, space selective chemical etching can be achieved. The etching rate depends sensitively on the polarization of the laser. Surprisingly, we observe that by chirping the Fourier-transform-limited femtosecond laser pulses to picosecond pulses, the polarization dependence of the etching rate disappears, whereas an efficient etching rate can still be maintained. Observation with a scanning electron microscope reveals that the chirped pulses can induce interconnected nanocracks in the irradiated areas which facilitates efficient introduction of the etchant into the microchannel. The reported technology is of great use for fabrication of three-dimensional (3D) microfluidic systems and glass-based 3D printing.