arXiv research

In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for $n$-party real summation in the shuffle model of differential privacy with $O_{ε, δ}(1)$ error and $Θ(ε\sqrt{n})$ one-bit messages per party. In contrast, every local model protocol for real summation must incur error $Ω(1/\sqrt{n})$, and there exist …

Combining differential privacy and federated learning improves data security.

Securely trains regression models with secret sharing for data collaboration.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

Wave trace singularity formula for fibre bundles generalizes Poisson summation.

Paper extends trigonometric summation formula with weights.

A new discrete privacy mechanism for federated learning.

The study shows how certain ODEs and integrals are regular under Borel summation.

New theorem shows every integer can be represented by knot summation.

Mathematical structures link Gromov-Witten to Donaldson-Thomas invariants.

Improved greedy 2-coordinate updates for optimization problems with constraints.

Stochastic gradient descent updates parameters with summation gradient computed from a random data batch. This summation will lead to unbalanced training process if the data we obtained is unbalanced. To address this issue, this paper takes the error variance and error mean both into consideration. The adaptively adjus…

Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation do…

A new method slices and sums radial kernels faster.

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …

We consider fast kernel summations in high dimensions: given a large set of points in $d$ dimensions (with $d \gg 3$) and a pair-potential function (the {\em kernel} function), we compute a weighted sum of all pairwise kernel interactions for each point in the set. Direct summation is equivalent to a (dense) matrix-vec…

Quantum dilogarithm function proven from a linear difference equation.

Dirichlet-Neumann duality for Riemannian submersions

For an eigenfunction of the Laplacian on a hyperbolic Riemann surface, the coefficients of the Fourier expansion are described as intertwining functionals. All intertwiners are classified. A refined growth estimate for the coefficients is given and a summation formula is proved.

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

We prove an explicit formula of the Berezin star product on Kaehler manifolds. The formula is expressed as a summation over certain strongly connected digraphs. The proof relies on a combinatorial interpretation of Englis' work on the asymptotic expansion of the Laplace integral.

Finet uses FBN for efficient, lightweight neural networks.

Study shows Bitcoin security tied to mining rewards and prices.

A pair of points in a riemannian manifold makes a secure configuration if the totality of geodesics connecting them can be blocked by a finite set. The manifold is secure if every configuration is secure. We investigate the security of compact, locally symmetric spaces.

We say that a pair of points x and y is secure if there exist a finite set of blocking points such that any geodesic between x and y passes through one of the blocking points. The main point of this paper is to exhibit new examples of blocking phenomena both in the manifold and the billiard table setting. As an approac…

New techniques prove quantum modularity for various functions.

For the Möbius spheres $S^{q,p}$, we give alternative elementary proofs of the recursive formulas for GJMS-operators and $Q$-curvatures due to the first author [Geom. Funct. Anal. 23, (2013), 1278-1370; arXiv:1108.0273]. These proofs make essential use of the theory of hypergeometric series.

Sparse oblique decision tree improves security rules for renewable power systems.

RL models improve target control in SSGs for security applications.

The exponential increase in dependencies between the cyber and physical world leads to an enormous amount of data which must be efficiently processed and stored. Therefore, computing paradigms are evolving towards machine learning (ML)-based systems because of their ability to efficiently and accurately process the eno…

A riemannian manifold is secure if the geodesics between any pair of points in the manifold can be blocked by a finite number of point obstacles. Compact, flat manifolds are secure. A standing conjecture says that these are the only secure, compact riemannian manifolds. The conjecture claims, in particular, that a riem…

New model values equity-linked securities with guaranteed return.

Paper proposes a secure protocol for federated learning.

Proposes a secure communication method independent of eavesdropper's decoder.

Most of the existing solutions to enterprise threat management are preventive approaches prescribing means to prevent policy violations with varying degrees of success. In this paper we consider the complementary scenario where a number of security violations have already occurred, or security threats, or vulnerabiliti…

Explores security challenges of machine learning in real-world systems.

Deep learning is increasingly used as a building block of security systems. Unfortunately, neural networks are hard to interpret and typically opaque to the practitioner. The machine learning community has started to address this problem by developing methods for explaining the predictions of neural networks. While sev…

In this paper are presented methods of impact analysis on informatics system security accidents, qualitative and quantitative methods, starting with risk and informational system security definitions. It is presented the relationship between the risks of exploiting vulnerabilities of security system, security level of …

This paper discusses adversarial attacks on cyber security systems using machine learning.

Unified market-based description of returns and variances of trades.

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a reduction from the security of this new model to the security of the ensemble classi…

Investigates the cost-effectiveness of security features in smart card chips.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

Contextual bandit framework improves revenue optimization in securities lending market.

Study assesses how much security restaking protocols need to pay for.

The future Internet of Things (IoT) will have a deep economical, commercial and social impact on our lives. The participating nodes in IoT networks are usually resource-constrained, which makes them luring targets for cyber attacks. In this regard, extensive efforts have been made to address the security and privacy is…

Survey examines ML for IoT security, addressing new challenges.

In this paper, we study some vanishing identities for Gromov-Witten invariants conjectured by K. Liu and H. Xu. We will prove these conjectures in the case that the summation range is large compare to genus. In fact, in such cases, we can obtain a vanishing identity which is stronger than their conjectures. Moreover we…