Searcharxiv⌕ Search

arXiv subjects

Fang Liu

Publications and source records attributed to Fang Liu.

At least 271 records · Page 15Linked to original sources

Noise-Augmented Privacy-Preserving Empirical Risk Minimization with Dual-purpose Regularizer and Privacy Budget Retrieval and Recycling

We propose Noise-Augmented Privacy-Preserving Empirical Risk Minimization (NAPP-ERM) that solves ERM with differential privacy guarantees. Existing privacy-preserving ERM approaches may be subject to over-regularization with the employment of an l2 term to achieve strong convexity on top of the target regularization. NAPP-ERM improves over the current approaches and mitigates over-regularization by iteratively realizing target regularization through appropriately designed augmented data and delivering strong convexity via a single adaptively weighted dual-purpose l2 regularizer. When the target regularization is for variable selection, we propose a new regularizer that achieves both privacy and sparsity guarantees simultaneously. Finally, we propose a strategy to retrieve privacy budget when the strong convexity requirement is met, which can be returned to users such that the DP of ERM is guaranteed at a lower privacy cost than originally planned, or be recycled to the ERM optimization procedure to reduce the injected DP noise and improve the utility of DP-ERM. From an implementation perspective, NAPP-ERM can be achieved by optimizing a non-perturbed object function given noise-augmented data and can thus leverage existing tools for non-private ERM optimization. We illustrate through extensive experiments the mitigation effect of the over-regularization and private budget retrieval by NAPP-ERM on variable selection and prediction.

stat.ML↗

High-performance Ba1-xKxFe2As2 superconducting joints for persistent current operation

Superconducting joints are one of the key technologies to make Ba1-xKxFe2As2 (Ba-122) superconducting wires or tapes for high-field applications. Herein, superconducting joints were fabricated by a simple cold-pressing method, and the joint resistance of the iron-based superconducting joint was estimated for the first time. The superconducting properties, microstructures, and elements distribution in the joint regions were investigated. At 4.2 K and 10 T, a transport critical current Ic of 105 A for the joint was obtained, and the critical current ratio (CCR= Ic-joint/Ic-tape) of the joint was 94.6%. On the other hand, the joint show very low joint resistance of 2.7x10^-13 ohm in self-field at 4.2 K. Among iron-based superconductors (IBS), this work is the first to successfully realize a superconducting joint with such high CCR and low joint resistance. This work shows great potential to apply Ba-122 in a range of practical applications, where superconducting joints are essential.

cond-mat.supr-con↗

LUAI Challenge 2021 on Learning to Understand Aerial Images

This report summarizes the results of Learning to Understand Aerial Images (LUAI) 2021 challenge held on ICCV 2021, which focuses on object detection and semantic segmentation in aerial images. Using DOTA-v2.0 and GID-15 datasets, this challenge proposes three tasks for oriented object detection, horizontal object detection, and semantic segmentation of common categories in aerial images. This challenge received a total of 146 registrations on the three tasks. Through the challenge, we hope to draw attention from a wide range of communities and call for more efforts on the problems of learning to understand aerial images.

cs.CV↗

Probing Electron-Hole Coherence in Strongly-Driven Solids

High-harmonic generation (HHG) is a coherent optical process in which the incident photon energy is up-converted to the multiples of its initial energy. In solids, under the influence of a strong laser field, electron-hole (e-h) pairs are generated and subsequently driven to high energy and momentum within a fraction of the optical cycle. These dynamics encode the band structure, including non-trivial topological properties of the source material, through both intraband current and interband polarization, into the high harmonic spectrum. In the course of this process, dephasing between the driven electron and the hole can significantly reduce the HHG efficiency. Here, we exploit this feature and turn it into a measurement of e-h coherence in strongly driven solids. Utilizing a pre-pump pulse, we first photodope monolayer molybdenum disulfide and then examine the HHG induced by an intense infrared pulse. We observe clear suppression of the HH intensity, which becomes more pronounced with increasing order. Based on quantum simulations, we attribute this monotonic order dependence as a signature of ultrafast electron-hole dephasing, which leads to an exponential decay of the inter-band polarization, proportional to the sub-cycle excursion time of the e-h pair. Our results demonstrate the importance of many-body effects, such as density-dependent decoherence in HHG and provide a novel platform to probe electron-hole coherence in strongly driven systems.

physics.optics↗

Dynamic Control for Random Access in Deadline-Constrained Broadcasting

This paper considers random access in deadline-constrained broadcasting with frame-synchronized traffic. To enhance the maximum achievable timely delivery ratio (TDR), we define a dynamic control scheme that allows each active node to determine the transmission probability with certainty based on the current delivery urgency and the knowledge of current contention intensity. For an idealized environment where the contention intensity is completely known, we develop an analytical framework based on the theory of Markov Decision Process (MDP), which leads to an optimal scheme by applying backward induction. For a realistic environment where the contention intensity is incompletely known, we develop a framework using Partially Observable Markov Decision Process (POMDP), which can in theory be solved. We show that for both environments, there exists an optimal scheme that is optimal over all types of policies. To overcome the infeasibility in obtaining an optimal or near-optimal scheme from the POMDP framework, we investigate the behaviors of the optimal scheme for two extreme cases in the MDP framework, and leverage intuition gained from these behaviors to propose a heuristic scheme for the realistic environment with TDR close to the maximum achievable TDR in the idealized environment. In addition, we propose an approximation on the knowledge of contention intensity to further simplify this heuristic scheme. Numerical results with respect to a wide range of configurations are provided to validate our study.

eess.SY↗

Regret theory under fear of the unknown

It is common to encounter the situation with uncertainty for decision makers (DMs) in dealing with a complex decision making problem. The existing evidence shows that people usually fear the extreme uncertainty named as the unknown. This paper reports the modified version of the typical regret theory by considering the fear experienced by DMs for the unknown. Based on the responses of undergraduate students to the hypothetical choice problems with an unknown outcome, some experimental evidences are observed and analyzed. The framework of the modified regret theory is established by considering the effects of an unknown outcome. A fear function is equipped and some implications are proved. The behavioral foundation of the modified regret theory is further developed by modifying the axiomatic properties of the existing one as those based on the utility function; and it is recalled as the utility-based behavioral foundation for convenience. The application to the medical decision making with an unknown risk is studied and the effects of the fear function are investigated. The observations reveal that the existence of an unknown outcome could enhance, impede or reverse the preference relation of people in a choice problem, which can be predicted by the developed regret theory.

econ.TH↗

Machine learning to tame divergent density functional approximations: a new path to consensus materials design principles

Computational virtual high-throughput screening (VHTS) with density functional theory (DFT) and machine-learning (ML)-acceleration is essential in rapid materials discovery. By necessity, efficient DFT-based workflows are carried out with a single density functional approximation (DFA). Nevertheless, properties evaluated with different DFAs can be expected to disagree for the cases with challenging electronic structure (e.g., open shell transition metal complexes, TMCs) for which rapid screening is most needed and accurate benchmarks are often unavailable. To quantify the effect of DFA bias, we introduce an approach to rapidly obtain property predictions from 23 representative DFAs spanning multiple families and "rungs" (e.g., semi-local to double hybrid) and basis sets on over 2,000 TMCs. Although computed properties (e.g., spin-state ordering and frontier orbital gap) naturally differ by DFA, high linear correlations persist across all DFAs. We train independent ML models for each DFA and observe convergent trends in feature importance; these features thus provide DFA-invariant, universal design rules. We devise a strategy to train ML models informed by all 23 DFAs and use them to predict properties (e.g., spin-splitting energy) of over 182k TMCs. By requiring consensus of the ANN-predicted DFA properties, we improve correspondence of these computational lead compounds with literature-mined, experimental compounds over the single-DFA approach typically employed. Both feature analysis and consensus-based ML provide efficient, alternative paths to overcome accuracy limitations of practical DFT.

cond-mat.mtrl-sci↗

Utility Optimal Thread Assignment and Resource Allocation in Multi-Server Systems

Achieving high performance in many multi-server systems requires finding a good assignment of worker threads to servers and also effectively allocating each server's resources to its assigned threads. The assignment and allocation components of this problem have been studied extensively but largely separately in the literature. In this paper, we introduce the assign and allocate (AA) problem, which seeks to simultaneously find an assignment and allocation that maximizes the total utility of the threads. Assigning and allocating the threads together can result in substantially better overall utility than performing the steps separately, as is traditionally done. We model each thread by a utility function giving its performance as a function of its assigned resources. We first prove that the AA problem is NP-hard. We then present a $2 (\sqrt{2}-1) > 0.828$ factor approximation algorithm for concave utility functions, which runs in $O(mn^2 + n (\log mC)^2)$ time for $n$ threads and $m$ servers with $C$ amount of resources each. We also give a faster algorithm with the same approximation ratio and $O(n (\log mC)^2)$ time complexity. We then extend the problem to two more general settings. First, we consider threads with nonconcave utility functions, and give a 1/2 factor approximation algorithm. Next, we give an algorithm for threads using multiple types of resources, and show the algorithm achieves good empirical performance. We conduct extensive experiments to test the performance of our algorithms on threads with both synthetic and realistic utility functions, and find that they achieve over 92\% of the optimal utility on average. We also compare our algorithms with a number of practical heuristics, and find that our algorithms achieve up to 9 times higher total utility.

cs.DC↗

Privacy-preserving Travel Time Prediction with Uncertainty Using GPS Trace Data

The rapid growth of GPS technology and mobile devices has led to a massive accumulation of location data, bringing considerable benefits to individuals and society. One of the major usages of such data is travel time prediction, a typical service provided by GPS navigation devices and apps. Meanwhile, the constant collection and analysis of the individual location data also pose unprecedented privacy threats. We leverage the notion of geo-indistinguishability, an extension of differential privacy to the location privacy setting, and propose a procedure for privacy-preserving travel time prediction without collecting actual individual GPS trace data. We propose new concepts to examine the impact of geo-indistinguishability-based sanitization on the usefulness of GPS traces and provide analytical and experimental utility analysis for privacy-preserving travel time prediction. We also propose new metrics to measure the adversary error in learning individual GPS traces from the collected sanitized data. Our experiment results suggest that the proposed procedure provides travel time prediction with satisfactory accuracy at reasonably small privacy costs.

cs.CR↗

One Model for All Quantization: A Quantized Network Supporting Hot-Swap Bit-Width Adjustment

As an effective technique to achieve the implementation of deep neural networks in edge devices, model quantization has been successfully applied in many practical applications. No matter the methods of quantization aware training (QAT) or post-training quantization (PTQ), they all depend on the target bit-widths. When the precision of quantization is adjusted, it is necessary to fine-tune the quantized model or minimize the quantization noise, which brings inconvenience in practical applications. In this work, we propose a method to train a model for all quantization that supports diverse bit-widths (e.g., form 8-bit to 1-bit) to satisfy the online quantization bit-width adjustment. It is hot-swappable that can provide specific quantization strategies for different candidates through multiscale quantization. We use wavelet decomposition and reconstruction to increase the diversity of weights, thus significantly improving the performance of each quantization candidate, especially at ultra-low bit-widths (e.g., 3-bit, 2-bit, and 1-bit). Experimental results on ImageNet and COCO show that our method can achieve accuracy comparable performance to dedicated models trained at the same precision.

cs.CV↗

Model-based Differentially Private Data Synthesis and Statistical Inference in Multiply Synthetic Differentially Private Data

We propose the approach of model-based differentially private synthesis (modips) in the Bayesian framework for releasing individual-level surrogate/synthetic datasets with privacy guarantees given the original data. The modips technique integrates the concept of differential privacy into model-based data synthesis. We introduce several variants for the general modips approach and different procedures to obtaining privacy-preserving posterior samples, a key step in modips. The uncertainty from the sanitization and synthetic process in modips can be accounted for by releasing multiple synthetic datasets and quantified via an inferential combination rule that is proposed in this paper. We run empirical studies to examine the impacts of the number of synthetic sets and the privacy budget allocation schemes on the inference based on synthetic data.

stat.ME↗

All-Optical Image Identification with Programmable Matrix Transformation

An optical neural network is proposed and demonstrated with programmable matrix transformation and nonlinear activation function of photodetection (square-law detection). Based on discrete phase-coherent spatial modes, the dimensionality of programmable optical matrix operations is 30~37, which is implemented by spatial light modulators. With this architecture, all-optical classification tasks of handwritten digits, objects and depth images are performed on the same platform with high accuracy. Due to the parallel nature of matrix multiplication, the processing speed of our proposed architecture is potentially as high as7.4T~74T FLOPs per second (with 10~100GHz detector)

physics.optics↗

Generation and dynamical manipulation of polarization entangled Bell states by a silicon quantum photonic circuit

A silicon quantum photonic circuit was proposed and demonstrated as an integrated quantum light source for telecom band polarization entangled Bell state generation and dynamical manipulation. Biphoton states were firstly generated in four silicon waveguides by spontaneous four wave mixing. They were transformed to polarization entangled Bell states through on-chip quantum interference and quantum superposition, and then coupled to optical fibers. The property of polarization entanglement in generated photon pairs was demonstrated by two-photon interferences under two non-orthogonal polarization bases. The output state could be dynamically switched between two polarization entangled Bell states, which was demonstrated by the experiment of simplified Bell state measurement. The experiment results indicate that its manipulation speed supported a modulation rate of several tens kHz, showing its potential on applications of quantum communication and quantum information processing requiring dynamical quantum entangled Bell state control.

quant-ph↗

MWQ: Multiscale Wavelet Quantized Neural Networks

Model quantization can reduce the model size and computational latency, it has become an essential technique for the deployment of deep neural networks on resourceconstrained hardware (e.g., mobile phones and embedded devices). The existing quantization methods mainly consider the numerical elements of the weights and activation values, ignoring the relationship between elements. The decline of representation ability and information loss usually lead to the performance degradation. Inspired by the characteristics of images in the frequency domain, we propose a novel multiscale wavelet quantization (MWQ) method. This method decomposes original data into multiscale frequency components by wavelet transform, and then quantizes the components of different scales, respectively. It exploits the multiscale frequency and spatial information to alleviate the information loss caused by quantization in the spatial domain. Because of the flexibility of MWQ, we demonstrate three applications (e.g., model compression, quantized network optimization, and information enhancement) on the ImageNet and COCO datasets. Experimental results show that our method has stronger representation ability and can play an effective role in quantized neural networks.

cs.CV↗

Effective and Fast: A Novel Sequential Single Path Search for Mixed-Precision Quantization

Since model quantization helps to reduce the model size and computation latency, it has been successfully applied in many applications of mobile phones, embedded devices and smart chips. The mixed-precision quantization model can match different quantization bit-precisions according to the sensitivity of different layers to achieve great performance. However, it is a difficult problem to quickly determine the quantization bit-precision of each layer in deep neural networks according to some constraints (e.g., hardware resources, energy consumption, model size and computation latency). To address this issue, we propose a novel sequential single path search (SSPS) method for mixed-precision quantization,in which the given constraints are introduced into its loss function to guide searching process. A single path search cell is used to combine a fully differentiable supernet, which can be optimized by gradient-based algorithms. Moreover, we sequentially determine the candidate precisions according to the selection certainties to exponentially reduce the search space and speed up the convergence of searching process. Experiments show that our method can efficiently search the mixed-precision models for different architectures (e.g., ResNet-20, 18, 34, 50 and MobileNet-V2) and datasets (e.g., CIFAR-10, ImageNet and COCO) under given constraints, and our experimental results verify that SSPS significantly outperforms their uniform counterparts.

cs.CV↗

SpecNet: Spectral Domain Convolutional Neural Network

The memory consumption of most Convolutional Neural Network (CNN) architectures grows rapidly with increasing depth of the network, which is a major constraint for efficient network training on modern GPUs with limited memory, embedded systems, and mobile devices. Several studies show that the feature maps (as generated after the convolutional layers) are the main bottleneck in this memory problem. Often, these feature maps mimic natural photographs in the sense that their energy is concentrated in the spectral domain. Although embedding CNN architectures in the spectral domain is widely exploited to accelerate the training process, we demonstrate that it is also possible to use the spectral domain to reduce the memory footprint, a method we call Spectral Domain Convolutional Neural Network (SpecNet) that performs both the convolution and the activation operations in the spectral domain. The performance of SpecNet is evaluated on three competitive object recognition benchmark tasks (CIFAR-10, SVHN, and ImageNet), and compared with several state-of-the-art implementations. Overall, SpecNet is able to reduce memory consumption by about 60% without significant loss of performance for all tested networks.

cs.CV↗

Entropic force between two horizons of dilaton black holes with a power-Maxwell field

In this paper, we consider $(n+1)$-dimensional topological dilaton de Sitter black holes with power-Maxwell field as thermodynamic systems. The thermodynamic quantities corresponding to the black hole horizon and the cosmological horizon respectively are interrelated. So the total entropy of the space-time should be the sum of the entropies of the black hole horizon and the cosmological horizon plus a corrected term which is produced by the association of the two horizons. We analyze the entropic force produced by the corrected term at given temperatures, which is affected by parameters and dimensions of the space-time. It is shown that the change of entropic force with the position ratio of two horizons in some region is similar to that of Lennard-Jones force with the position of particles. If the effect of entropic force is similar to that of Lennard-Jones force, and other forces are absent, the motion of the cosmological horizon relative to the black hole horizon would have an oscillating process. The entropic force between the two horizons is probably one of the participants to drive the evolution of universe.

hep-th↗

Construction of Differentially Private Empirical Distributions from a low-order Marginals Set through Solving Linear Equations with l2 Regularization

We introduce a new algorithm, Construction of dIfferentially Private Empirical Distributions from a low-order marginals set tHrough solving linear Equations with l2 Regularization (CIPHER), that produces differentially private empirical joint distributions from a set of low-order marginals. CIPHER is conceptually simple and requires no more than decomposing joint probabilities via basic probability rules to construct a linear equation set and subsequently solving the equations. Compared to the full-dimensional histogram (FDH) sanitization, CIPHER has drastic\-ally lower requirements on computational storage and memory, which is practically attractive especially considering that the high-order signals preserved by the FDH sanitization are likely just sample randomness and rarely of interest. Our experiments demonstrate that CIPHER outperforms the multiplicative weighting exponential mechanism in preserving original information and has similar or superior cost-normalized utility to FDH sanitization at the same privacy budget.

cs.LG↗