Searcharxiv⌕ Search

arXiv subjects

Lin Chen

Publications and source records attributed to Lin Chen.

At least 433 records · Page 24Linked to original sources

Generative Imaging and Image Processing via Generative Encoder

This paper introduces a novel generative encoder (GE) model for generative imaging and image processing with applications in compressed sensing and imaging, image compression, denoising, inpainting, deblurring, and super-resolution. The GE model consists of a pre-training phase and a solving phase. In the pre-training phase, we separately train two deep neural networks: a generative adversarial network (GAN) with a generator $\G$ that captures the data distribution of a given image set, and an auto-encoder (AE) network with an encoder $\EN$ that compresses images following the estimated distribution by GAN. In the solving phase, given a noisy image $x=\mathcal{P}(x^*)$, where $x^*$ is the target unknown image, $\mathcal{P}$ is an operator adding an addictive, or multiplicative, or convolutional noise, or equivalently given such an image $x$ in the compressed domain, i.e., given $m=\EN(x)$, we solve the optimization problem \[ z^*=\underset{z}{\mathrm{argmin}} \|\EN(\G(z))-m\|_2^2+λ\|z\|_2^2 \] to recover the image $x^*$ in a generative way via $\hat{x}:=\G(z^*)\approx x^*$, where $λ>0$ is a hyperparameter. The GE model unifies the generative capacity of GANs and the stability of AEs in an optimization framework above instead of stacking GANs and AEs into a single network or combining their loss functions into one as in existing literature. Numerical experiments show that the proposed model outperforms several state-of-the-art algorithms.

eess.IV↗

Known-class Aware Self-ensemble for Open Set Domain Adaptation

Existing domain adaptation methods generally assume different domains have the identical label space, which is quite restrict for real-world applications. In this paper, we focus on a more realistic and challenging case of open set domain adaptation. Particularly, in open set domain adaptation, we allow the classes from the source and target domains to be partially overlapped. In this case, the assumption of conventional distribution alignment does not hold anymore, due to the different label spaces in two domains. To tackle this challenge, we propose a new approach coined as Known-class Aware Self-Ensemble (KASE), which is built upon the recently developed self-ensemble model. In KASE, we first introduce a Known-class Aware Recognition (KAR) module to identify the known and unknown classes from the target domain, which is achieved by encouraging a low cross-entropy for known classes and a high entropy based on the source data from the unknown class. Then, we develop a Known-class Aware Adaptation (KAA) module to better adapt from the source domain to the target by reweighing the adaptation loss based on the likeliness to belong to known classes of unlabeled target samples as predicted by KAR. Extensive experiments on multiple benchmark datasets demonstrate the effectiveness of our approach.

cs.CV↗

Categorical Feature Compression via Submodular Optimization

In the era of big data, learning from categorical features with very large vocabularies (e.g., 28 million for the Criteo click prediction dataset) has become a practical challenge for machine learning researchers and practitioners. We design a highly-scalable vocabulary compression algorithm that seeks to maximize the mutual information between the compressed categorical feature and the target binary labels and we furthermore show that its solution is guaranteed to be within a $1-1/e \approx 63\%$ factor of the global optimal solution. To achieve this, we introduce a novel re-parametrization of the mutual information objective, which we prove is submodular, and design a data structure to query the submodular function in amortized $O(\log n )$ time (where $n$ is the input vocabulary size). Our complete algorithm is shown to operate in $O(n \log n )$ time. Additionally, we design a distributed implementation in which the query data structure is decomposed across $O(k)$ machines such that each machine only requires $O(\frac n k)$ space, while still preserving the approximation guarantee and using only logarithmic rounds of computation. We also provide analysis of simple alternative heuristic compression methods to demonstrate they cannot achieve any approximation guarantee. Using the large-scale Criteo learning task, we demonstrate better performance in retaining mutual information and also verify competitive learning performance compared to other baseline methods.

cs.LG↗

Real Entries of Complex Hadamard Matrices and Mutually Unbiased Bases in Dimension Six

We investigate the number of real entries of an $n\times n$ complex Hadamard matrix (CHM). We analytically derive the numbers when $n=2,3,4,6$. In particular, the number can be any one of $0-22,24,25,26,30$ for $n=6$. We apply our result to the existence of four mutually unbiased bases (MUBs) in dimension six, which is a long-standing open problem in quantum physics and information. We show that if four MUBs containing the identity matrix exists then the real entries in any one of the remaining three matrices does not exceed $22$.

math-ph↗

Covering a tree with rooted subtrees

We consider the multiple traveling salesman problem on a weighted tree. In this problem there are $m$ salesmen located at the root initially. Each of them will visit a subset of vertices and return to the root. The goal is to assign a tour to every salesman such that every vertex is visited and the longest tour among all salesmen is minimized. The problem is equivalent to the subtree cover problem, in which we cover a tree with rooted subtrees such that the weight of the maximum weighted subtree is minimized. The classical machine scheduling problem can be viewed as a special case of our problem when the given tree is a star. We observe that, the problem remains NP-hard even if tree height and edge weight are constant, and present an FPT algorithm for this problem parameterized by the largest tour length. To achieve the FPT algorithm, we show a more general result. We prove that, integer linear programming that has a tree-fold structure is in FPT, which extends the FPT result for the $n$-fold integer programming by Hemmecke, Onn and Romanchuk.

cs.DS↗

WIDER Face and Pedestrian Challenge 2018: Methods and Results

This paper presents a review of the 2018 WIDER Challenge on Face and Pedestrian. The challenge focuses on the problem of precise localization of human faces and bodies, and accurate association of identities. It comprises of three tracks: (i) WIDER Face which aims at soliciting new approaches to advance the state-of-the-art in face detection, (ii) WIDER Pedestrian which aims to find effective and efficient approaches to address the problem of pedestrian detection in unconstrained environments, and (iii) WIDER Person Search which presents an exciting challenge of searching persons across 192 movies. In total, 73 teams made valid submissions to the challenge tracks. We summarize the winning solutions for all three tracks. and present discussions on open problems and potential research directions in these topics.

cs.CV↗

Heterogeneous Coexistence of Cognitive Radio Networks in TV White Space

Wireless standards (e.g., IEEE 802.11af and 802.22) have been developed for enabling opportunistic access in TV white space (TVWS) using cognitive radio (CR) technology. When heterogeneous CR networks that are based on different wireless standards operate in the same TVWS, coexistence issues can potentially cause major problems. Enabling collaborative coexistence via direct coordination between heterogeneous CR networks is very challenging, due to incompatible MAC/PHY designs of coexisting networks, requirement of an over-the-air common control channel for inter-network communications, and time synchronization across devices from different networks. Moreover, such a coexistence scheme would require competing networks or service providers to exchange sensitive control information that may raise conflict of interest issues and customer privacy concerns. In this paper, we present an architecture for enabling collaborative coexistence of heterogeneous CR networks over TVWS, called Symbiotic Heterogeneous coexistence ARchitecturE (SHARE). Define "indirect coordination" first before using it. Because coexistence cannot avoid coordination By mimicking the symbiotic relationships between heterogeneous organisms in a stable ecosystem, SHARE establishes an indirect coordination mechanism between heterogeneous CR networks via a mediator system, which avoids the drawbacks of direct coordination. SHARE includes two spectrum sharing algorithms whose designs were inspired by well-known models and theories from theoretical ecology, viz, the interspecific competition model and the ideal free distribution model.

cs.NI↗

$4\times4$ unextendible product basis and genuinely entangled space

We show that there are six inequivalent $4\times4$ unextendible product bases (UPBs) of size eight, when we consider only 4-qubit product vectors. We apply our results to construct Positive-Partial-Transpose entangled states of rank nine. They are at the same 4-qubit, $2\times2\times4$ and $4\times4$ states, and their ranges have product vectors. One of the six UPBs turns out to be orthogonal to an almost genuinely entangled space, in the sense that the latter does not contain $4\times4$ product vector in any bipartition of 4-qubit systems. We also show that the multipartite UPB orthogonal to a genuinely entangled space exists if and only if the $n\times n\times n$ UPB orthogonal to a genuinely entangled space exists for some $n$. These results help understand an open problem in [Phys. Rev. A 98, 012313, 2018].

quant-ph↗

Additivity of entanglement of formation via entanglement-breaking space

We study the entanglement-breaking (EB) space, such that the entanglement of formation (EOF) of a bipartite quantum state is additive when its range is an EB subspace. We systematically construct the EB spaces in the Hilbert space $\bbC^m\otimes\bbC^3$, and the $2$-dimensional EB space in $\bbC^2\otimes\bbC^n$. We characterize the expression of two-qubit states of rank two with nonadditive EOF, if they exist. We further apply our results to construct EB spaces of an arbitrarily given dimensions. We show that the example in [PRL 89,027901(2002)] is a special case of our results. We further work out the entanglement cost of a qubit-qutrit state in terms of the two-atom system of the .

quant-ph↗

Separability of Completely Symmetric States in Multipartite System

Symmetry plays an important role in the field of quantum mechanics. In this paper, we consider a subclass of symmetric quantum states in the multipartite system $N^{\otimes d}$, namely, the completely symmetric states, which are invariant under any index permutation. It was conjectured by L. Qian and D. Chu [arXiv:1810.03125 [quant-ph]] that the completely symmetric states are separable if and only if it is a convex combination of symmetric pure product states. In this paper, we proved that this conjecture is true for both bipartite and multipartite cases. And we proved the completely symmetric state $ρ$ is separable if its rank is at most $5$ or $N+1$. For the states of rank $6$ or $N+2$, they are separable if and only if their range contains a product vector. We apply our results to a few widely useful states in quantum information, such as symmetric states, edge states, extreme states, and nonnegative states. We also study the relation of CS states to Hankel and Toeplitz matrices.

quant-ph↗

Differentially Private User-based Collaborative Filtering Recommendation Based on K-means Clustering

Collaborative filtering (CF) recommendation algorithms are well-known for their outstanding recommendation performances, but previous researches showed that they could cause privacy leakage for users due to k-nearest neighboring (KNN) attacks. Recently, the notion of differential privacy (DP) has been applied to privacy preservation for collaborative filtering recommendation algorithms. However, as far as we know, existing differentially private CF recommendation schemes degraded the recommendation performance (such as recall and precision) to an unacceptable level. In this paper, in order to address the performance degradation problem, we propose a differentially private user-based collaborative filtering recommendation scheme based on k-means clustering (KDPCF). Specifically, to improve the recommendation performance, we first cluster the dataset into categories by k-means clustering and appropriately adjust the size of the target category to which the target user belongs, so that only users in the well-sized target category can be used for recommendations. Then we efficiently select a set of neighbors from the target category at one time by employing only one exponential mechanism instead of the composition of multiple ones, and base on the neighbor set to recommend. We theoretically prove that our scheme achieves differential privacy. Empirically, we use the MovieLens dataset to evaluate our recommendation system. The experimental results demonstrate a significant performance gain compared to existing schemes.

cs.CR↗

Optimal Algorithms for Scheduling under Time-of-Use Tariffs

We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines. The problem of minimizing the total (weighted) completion time is considerably harder, even on a single machine. We present a polynomial-time algorithm that computes for any given sequence of jobs an optimal schedule, i.e., the optimal set of time-slots to be used for scheduling jobs according to the given sequence. This result is based on dynamic programming using a subtle analysis of the structure of optimal solutions and a potential function argument. With this algorithm, we solve the unweighted problem optimally in polynomial time. For the more general problem, in which jobs may have individual weights, we develop a polynomial-time approximation scheme (PTAS) based on a dual scheduling approach introduced for scheduling on a machine of varying speed. As the weighted problem is strongly NP-hard, our PTAS is the best possible approximation we can hope for.

cs.DS↗

A general framework for handling commitment in online throughput maximization

We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes the number of jobs that complete on time. To circumvent known impossibility results, we make a standard slackness assumption by which the feasible time window for scheduling a job is at least $1+\varepsilon$ times its processing time, for some $\varepsilon>0$. We quantify the impact that different provider commitment requirements have on the performance of online algorithms. Our main contribution is one universal algorithmic framework for online job admission both with and without commitments. Without commitment, our algorithm with a competitive ratio of $O(1/\varepsilon)$ is the best possible (deterministic) for this problem. For commitment models, we give the first non-trivial performance bounds. If the commitment decisions must be made before a job's slack becomes less than a $δ$-fraction of its size, we prove a competitive ratio of $O(\varepsilon/((\varepsilon-δ)δ^2))$, for $0<δ<\varepsilon$. When a provider must commit upon starting a job, our bound is $O(1/\varepsilon^2)$. Finally, we observe that for scheduling with commitment the restriction to the `unweighted' throughput model is essential; if jobs have individual weights, we rule out competitive deterministic algorithms.

cs.DS↗

Unconstrained Submodular Maximization with Constant Adaptive Complexity

In this paper, we consider the unconstrained submodular maximization problem. We propose the first algorithm for this problem that achieves a tight $(1/2-\varepsilon)$-approximation guarantee using $\tilde{O}(\varepsilon^{-1})$ adaptive rounds and a linear number of function evaluations. No previously known algorithm for this problem achieves an approximation ratio better than $1/3$ using less than $Ω(n)$ rounds of adaptivity, where $n$ is the size of the ground set. Moreover, our algorithm easily extends to the maximization of a non-negative continuous DR-submodular function subject to a box constraint and achieves a tight $(1/2-\varepsilon)$-approximation guarantee for this problem while keeping the same adaptive and query complexities.

cs.DS↗

Efficient Public Blockchain Client for Lightweight Users

Public blockchains provide a decentralized method for storing transaction data and have many applications in different sectors. In order for users to track transactions, a simple method is to let them keep a local copy of the entire public ledger. Since the size of the ledger keeps growing, this method becomes increasingly less practical, especially for lightweight users such as IoT devices and smartphones. In order to cope with the problem, several solutions have been proposed to reduce the storage burden. However, existing solutions either achieve a limited storage reduction (e.g., simple payment verification), or rely on some strong security assumption (e.g., the use of trusted server). In this paper, we propose a new approach to solving the problem. Specifically, we propose an \underline{e}fficient verification protocol for \underline{p}ublic \underline{b}lock\underline{c}hains, or EPBC for short. EPBC is particularly suitable for lightweight users, who only need to store a small amount of data that is {\it independent of} the size of the blockchain. We analyze EPBC's performance and security, and discuss its integration with existing public ledger systems. Experimental results confirm that EPBC is practical for lightweight users.

cs.CR↗

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm

Bribery in election (or computational social choice in general) is an important problem that has received a considerable amount of attention. In the classic bribery problem, the briber (or attacker) bribes some voters in attempting to make the briber's designated candidate win an election. In this paper, we introduce a novel variant of the bribery problem, "Election with Bribed Voter Uncertainty" or BVU for short, accommodating the uncertainty that the vote of a bribed voter may or may not be counted. This uncertainty occurs either because a bribed voter may not cast its vote in fear of being caught, or because a bribed voter is indeed caught and therefore its vote is discarded. As a first step towards ultimately understanding and addressing this important problem, we show that it does not admit any multiplicative $O(1)$-approximation algorithm modulo standard complexity assumptions. We further show that there is an approximation algorithm that returns a solution with an additive-$ε$ error in FPT time for any fixed $ε$.

cs.DS↗

Constructing $2\times2\times4$ and $4\times4$ unextendible product bases and positive-partial-transpose entangled states

The 4-qubit unextendible product basis (UPB) has been recently studied by [Johnston, J. Phys. A: Math. Theor. 47 (2014) 424034]. From this result we show that there is only one UPB of size $6$ and six UPBs of size $9$ in $\cH=\bbC^2\ox\bbC^2\ox\bbC^4$, three UPBs of size $9$ in $\cK=\bbC^4\ox\bbC^4$, and no UPB of size $7$ in $\cH$ and $\cK$. Furthermore we construct a 4-qubit positive-partial-transpose (PPT) entangled state $\r$ of rank seven, and show that it is also a PPT entangled state in $\cH$ and $\cK$, respectively. We analytically derive the geometric measure of entanglement of a special $\r$.

quant-ph↗

PP-MCSA: Privacy Preserving Multi-Channel Double Spectrum Auction

Auction is widely regarded as an effective way in dynamic spectrum redistribution. Recently, considerable research efforts have been devoted to designing privacy-preserving spectrum auctions in a variety of auction settings. However, none of existing work has addressed the privacy issue in the most generic scenario, double spectrum auctions where each seller sells multiple channels and each buyer buys multiple channels. To fill this gap, in this paper we propose PP-MCSA, a Privacy Preserving mechanism for Multi-Channel double Spectrum Auctions. Technically, by leveraging garbled circuits, we manage to protect the privacy of both sellers' requests and buyers' bids in multi-channel double spectrum auctions. As far as we know, PP-MCSA is the first privacy-preserving solution for multi-channel double spectrum auctions. We further theoretically demonstrate the privacy guarantee of PP-MCSA, and extensively evaluate its performance via experiments. Experimental results show that PP-MCSA incurs only moderate communication and computation overhead.

cs.CR↗