Searcharxiv⌕ Search

arXiv subjects

Weiping Wang

Publications and source records attributed to Weiping Wang.

158 records · Page 9Linked to original sources

Input Perturbation: A New Paradigm between Central and Local Differential Privacy

Traditionally, there are two models on differential privacy: the central model and the local model. The central model focuses on the machine learning model and the local model focuses on the training data. In this paper, we study the \textit{input perturbation} method in differentially private empirical risk minimization (DP-ERM), preserving privacy of the central model. By adding noise to the original training data and training with the `perturbed data', we achieve ($ε$,$δ$)-differential privacy on the final model, along with some kind of privacy on the original data. We observe that there is an interesting connection between the local model and the central model: the perturbation on the original data causes the perturbation on the gradient, and finally the model parameters. This observation means that our method builds a bridge between local and central model, protecting the data, the gradient and the model simultaneously, which is more superior than previous central methods. Detailed theoretical analysis and experiments show that our method achieves almost the same (or even better) performance as some of the best previous central methods with more protections on privacy, which is an attractive result. Moreover, we extend our method to a more general case: the loss function satisfies the Polyak-Lojasiewicz condition, which is more general than strong convexity, the constraint on the loss function in most previous work.

cs.LG↗

Video Cloze Procedure for Self-Supervised Spatio-Temporal Learning

We propose a novel self-supervised method, referred to as Video Cloze Procedure (VCP), to learn rich spatial-temporal representations. VCP first generates "blanks" by withholding video clips and then creates "options" by applying spatio-temporal operations on the withheld clips. Finally, it fills the blanks with "options" and learns representations by predicting the categories of operations applied on the clips. VCP can act as either a proxy task or a target task in self-supervised learning. As a proxy task, it converts rich self-supervised representations into video clip operations (options), which enhances the flexibility and reduces the complexity of representation learning. As a target task, it can assess learned representation models in a uniform and interpretable manner. With VCP, we train spatial-temporal representation models (3D-CNNs) and apply such models on action recognition and video retrieval tasks. Experiments on commonly used benchmarks show that the trained models outperform the state-of-the-art self-supervised models with significant margins.

cs.CV↗

Weighted Distributed Differential Privacy ERM: Convex and Non-convex

Distributed machine learning is an approach allowing different parties to learn a model over all data sets without disclosing their own data. In this paper, we propose a weighted distributed differential privacy (WD-DP) empirical risk minimization (ERM) method to train a model in distributed setting, considering different weights of different clients. We guarantee differential privacy by gradient perturbation, adding Gaussian noise, and advance the state-of-the-art on gradient perturbation method in distributed setting. By detailed theoretical analysis, we show that in distributed setting, the noise bound and the excess empirical risk bound can be improved by considering different weights held by multiple parties. Moreover, considering that the constraint of convex loss function in ERM is not easy to achieve in some situations, we generalize our method to non-convex loss functions which satisfy Polyak-Lojasiewicz condition. Experiments on real data sets show that our method is more reliable and we improve the performance of distributed differential privacy ERM, especially in the case that data scale on different clients is uneven.

cs.LG↗

Alternating multiple zeta values, and explicit formulas of some Euler-Apery-type series

In this paper, we study some Euler-Apéry-type series which involve central binomial coefficients and (generalized) harmonic numbers. In particular, we establish elegant explicit formulas of some series by iterated integrals and alternating multiple zeta values. Based on these formulas, we further show that some other series are reducible to ln(2), zeta values, and alternating multiple zeta values by considering the contour integrals related to gamma functions, polygamma functions and trigonometric functions. The evaluations of a large number of special Euler-Apéry-type series are presented as examples.

math.NT↗

Curved Text Detection in Natural Scene Images with Semi- and Weakly-Supervised Learning

Detecting curved text in the wild is very challenging. Recently, most state-of-the-art methods are segmentation based and require pixel-level annotations. We propose a novel scheme to train an accurate text detector using only a small amount of pixel-level annotated data and a large amount of data annotated with rectangles or even unlabeled data. A baseline model is first obtained by training with the pixel-level annotated data and then used to annotate unlabeled or weakly labeled data. A novel strategy which utilizes ground-truth bounding boxes to generate pseudo mask annotations is proposed in weakly-supervised learning. Experimental results on CTW1500 and Total-Text demonstrate that our method can substantially reduce the requirement of pixel-level annotated data. Our method can also generalize well across two datasets. The performance of the proposed method is comparable with the state-of-the-art methods with only 10% pixel-level annotated data and 90% rectangle-level weakly annotated data.

cs.CV↗

Explicit formulas of Euler sums via multiple zeta values

Flajolet and Salvy pointed out that every Euler sum is a $\mathbb{Q}$-linear combination of multiple zeta values. However, in the literature, there is no formula completely revealing this relation. In this paper, using permutations and compositions, we establish two explicit formulas for the Euler sums, and show that all the Euler sums are indeed expressible in terms of MZVs. Moreover, we apply this method to the alternating Euler sums, and show that all the alternating Euler sums are reducible to alternating MZVs. Some famous results, such as the Euler theorem, the Borwein--Borwein--Girgensohn theorems, and the Flajolet--Salvy theorems can be obtained directly from our theory. Some other special cases, such as the explicit expressions of $S_{r^m,q}$, $S_{r^m,\bar{q}}$, $S_{\bar{r}^m,q}$ and $S_{\bar{r}^m,\bar{q}}$, are also presented here. The corresponding Maple programs are developed to help us compute all the sums of weight $w\leq 11$ for non-alternating case and of weight $w\leq 6$ for alternating case.

math.NT↗

Efficient Cross-Validation for Semi-Supervised Learning

Manifold regularization, such as laplacian regularized least squares (LapRLS) and laplacian support vector machine (LapSVM), has been widely used in semi-supervised learning, and its performance greatly depends on the choice of some hyper-parameters. Cross-validation (CV) is the most popular approach for selecting the optimal hyper-parameters, but it has high complexity due to multiple times of learner training. In this paper, we provide a method to approximate the CV for manifold regularization based on a notion of robust statistics, called Bouligand influence function (BIF). We first provide a strategy for approximating the CV via the Taylor expansion of BIF. Then, we show how to calculate the BIF for general loss function,and further give the approximate CV criteria for model selection in manifold regularization. The proposed approximate CV for manifold regularization requires training only once, hence can significantly improve the efficiency of traditional CV. Experimental results show that our approximate CV has no statistical discrepancy with the original one, but much smaller time cost.

cs.LG↗

Max-Diversity Distributed Learning: Theory and Algorithms

We study the risk performance of distributed learning for the regularization empirical risk minimization with fast convergence rate, substantially improving the error analysis of the existing divide-and-conquer based distributed learning. An interesting theoretical finding is that the larger the diversity of each local estimate is, the tighter the risk bound is. This theoretical analysis motivates us to devise an effective maxdiversity distributed learning algorithm (MDD). Experimental results show that MDD can outperform the existing divide-andconquer methods but with a bit more time. Theoretical analysis and empirical results demonstrate that our proposed MDD is sound and effective.

cs.LG↗

Does accelerating universe indicates Brans-Dicke theory

The evolution of universe in Brans-Dicke (BD) theory is discussed in this paper. Considering a parameterized scenario for BD scalar field $ϕ=ϕ_{0}a^α$ which plays the role of gravitational "constant" $G$, we apply the Markov Chain Monte Carlo method to investigate a global constraints on BD theory with a self-interacting potential according to the current observational data: Union2 dataset of type supernovae Ia (SNIa), high-redshift Gamma-Ray Bursts (GRBs) data, observational Hubble data (OHD), the cluster X-ray gas mass fraction, the baryon acoustic oscillation (BAO), and the cosmic microwave background (CMB) data. It is shown that an expanded universe from deceleration to acceleration is given in this theory, and the constraint results of dimensionless matter density $Ω_{0m}$ and parameter $α$ are, $Ω_{0m}=0.286^{+0.037+0.050}_{-0.039-0.047}$ and $α=0.0046^{+0.0149+0.0171}_{-0.0171-0.0206}$ which is consistent with the result of current experiment exploration, $\midα\mid \leq 0.132124$. In addition, we use the geometrical diagnostic method, jerk parameter $j$, to distinguish the BD theory and cosmological constant model in Einstein's theory of general relativity.

astro-ph.CO↗

Service-Oriented Simulation Framework: An Overview and Unifying Methodology

The prevailing net-centric environment demands and enables modeling and simulation to combine efforts from numerous disciplines. Software techniques and methodology, in particular service-oriented architecture, provide such an opportunity. Service-oriented simulation has been an emerging paradigm following on from object- and process-oriented methods. However, the ad-hoc frameworks proposed so far generally focus on specific domains or systems and each has its pros and cons. They are capable of addressing different issues within service-oriented simulation from different viewpoints. It is increasingly important to describe and evaluate the progress of numerous frameworks. In this paper, we propose a novel three-dimensional reference model for a service-oriented simulation paradigm. The model can be used as a guideline or an analytic means to find the potential and possible future directions of the current simulation frameworks. In particular, the model inspects the crossover between the disciplines of modeling and simulation, service-orientation, and software/systems engineering. Based on the model, we present a comprehensive survey on several classical service-oriented simulation frameworks, including formalism-based, model-driven, interoperability protocol based, eXtensible Modeling and Simulation Framework (XMSF), and Open Grid Services Architecture (OGSA) based frameworks etc. The comparison of these frameworks is also performed. Finally the significance both in academia and practice are presented and future directions are pointed out.

cs.SE↗

Three-dimensional conceptual model for service-oriented simulation

In this letter, we propose a novel three-dimensional conceptual model for an emerging service-oriented simulation paradigm. The model can be used as a guideline or an analytic means to find the potential and possible future directions of the current simulation frameworks. In particular, the model inspects the crossover between the disciplines of modeling and simulation, service-orientation, and software/systems engineering. Finally, two specific simulation frameworks are studied as examples.

cs.SE↗

High level architecture evolved modular federation object model

To improve the agility, dynamics, composability, reusability, and development efficiency restricted by monolithic Federation Object Model (FOM), a modular FOM was proposed by High Level Architecture (HLA) Evolved product development group. This paper reviews the state-of-the-art of HLA Evolved modular FOM. In particular, related concepts, the overall impact on HLA standards, extension principles, and merging processes are discussed. Also permitted and restricted combinations, and merging rules are provided, and the influence on HLA interface specification is given. The comparison between modular FOM and Base Object Model (BOM) is performed to illustrate the importance of their combination. The applications of modular FOM are summarized. Finally, the significance to facilitate composable simulation both in academia and practice is presented and future directions are pointed out.

cs.SE↗

Service-oriented high level architecture

Service-oriented High Level Architecture (SOHLA) refers to the high level architecture (HLA) enabled by Service-Oriented Architecture (SOA) and Web Services etc. techniques which supports distributed interoperating services. The detailed comparisons between HLA and SOA are made to illustrate the importance of their combination. Then several key enhancements and changes of HLA Evolved Web Service API are introduced in comparison with native APIs, such as Federation Development and Execution Process, communication mechanisms, data encoding, session handling, testing environment and performance analysis. Some approaches are summarized including Web-Enabling HLA at the communication layer, HLA interface specification layer, federate interface layer and application layer. Finally the problems of current research are discussed, and the future directions are pointed out.

cs.SE↗

Complex Agent Networks explaining the HIV epidemic among homosexual men in Amsterdam

Simulating the evolution of the Human Immunodeficiency Virus (HIV) epidemic requires a detailed description of the population network, especially for small populations in which individuals can be represented in detail and accuracy. In this paper, we introduce the concept of a Complex Agent Network(CAN) to model the HIV epidemics by combining agent-based modelling and complex networks, in which agents represent individuals that have sexual interactions. The applicability of CANs is demonstrated by constructing and executing a detailed HIV epidemic model for men who have sex with men (MSM) in Amsterdam, including a distinction between steady and casual relationships. We focus on MSM contacts because they play an important role in HIV epidemics and have been tracked in Amsterdam for a long time. Our experiments show good correspondence between the historical data of the Amsterdam cohort and the simulation results.

cs.MA↗