Searcharxiv⌕ Search

arXiv subjects

Siqi Liu

Publications and source records attributed to Siqi Liu.

At least 73 records · Page 4Linked to original sources
arXiv2023

Enhancing NAC-ABE to Support Access Control for mHealth Applications and Beyond

Name-based access control (NAC) over NDN provides fine-grained data confidentiality and access control by encrypting and signing data at the time of data production. NAC utilizes specially crafted naming conventions to define and enforce access control policies. NAC-ABE, an extension to NAC, uses an attribute-based encryption (ABE) scheme to support access control with improved scalability and flexibility. However, existing NAC-ABE libraries are based on ciphertext-policy ABE (CP-ABE), which requires knowledge of the access policy when encrypting data packets. In some applications, including mHealth, the data access policy is unknown at the time of data generation, while data attributes and properties are known. In this paper, we present an extension to the existing NDN-ABE library which can be used by mHealth and other applications to enforce fine-granularity access control in data sharing. We also discuss the challenges we encountered during the application deployment, and remaining open issues together with potential solution directions.

cs.CR↗
arXiv2023

EDIS: Entity-Driven Image Search over Multimodal Web Content

Making image retrieval methods practical for real-world search applications requires significant progress in dataset scales, entity comprehension, and multimodal information fusion. In this work, we introduce \textbf{E}ntity-\textbf{D}riven \textbf{I}mage \textbf{S}earch (EDIS), a challenging dataset for cross-modal image search in the news domain. EDIS consists of 1 million web images from actual search engine results and curated datasets, with each image paired with a textual description. Unlike datasets that assume a small set of single-modality candidates, EDIS reflects real-world web image search scenarios by including a million multimodal image-text pairs as candidates. EDIS encourages the development of retrieval models that simultaneously address cross-modal information fusion and matching. To achieve accurate ranking results, a model must: 1) understand named entities and events from text queries, 2) ground entities onto images or text descriptions, and 3) effectively fuse textual and visual representations. Our experimental results show that EDIS challenges state-of-the-art methods with dense entities and a large-scale candidate set. The ablation study also proves that fusing textual features with visual features is critical in improving retrieval results.

cs.CL↗
arXiv2023

Multi-stream Cell Segmentation with Low-level Cues for Multi-modality Images

Cell segmentation for multi-modal microscopy images remains a challenge due to the complex textures, patterns, and cell shapes in these images. To tackle the problem, we first develop an automatic cell classification pipeline to label the microscopy images based on their low-level image characteristics, and then train a classification model based on the category labels. Afterward, we train a separate segmentation model for each category using the images in the corresponding category. Besides, we further deploy two types of segmentation models to segment cells with roundish and irregular shapes respectively. Moreover, an efficient and powerful backbone model is utilized to enhance the efficiency of our segmentation model. Evaluated on the Tuning Set of NeurIPS 2022 Cell Segmentation Challenge, our method achieves an F1-score of 0.8795 and the running time for all cases is within the time tolerance.

cs.CV↗
arXiv2023

New Codes on High Dimensional Expanders

We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are functions on a subset of $\mathbb{F}^n$ whose restrictions to a prescribed set of affine lines has low degree. Alternatively, they are Tanner codes on high dimensional expanders, where the coordinates of the codeword correspond to triangles of a $2$-dimensional expander, such that around every edge the local view forms a Reed-Solomon codeword. For some range of parameters our codes are provably locally testable, and their dimension is some fixed power of the block length. For another range of parameters our codes have distance and dimension that are both linear in the block length, but we do not know if they are locally testable. The codes also have the multiplication property: the coordinate-wise product of two codewords is a codeword in a related code. The definition of the codes relies on the construction of a specific family of simplicial complexes which is a slight variant on the coset complexes of Kaufman and Oppenheim. We show a novel way to embed the triangles of these complexes into $\mathbb{F}^n$, with the property that links of edges embed as affine lines in $\mathbb{F}^n$. We rely on this embedding to lower bound the rate of these codes in a way that avoids constraint-counting and thereby achieves non-trivial rate even when the local codes themselves have arbitrarily small rate, and in particular below $1/2$.

cs.IT↗
arXiv2023

Beyond Object Recognition: A New Benchmark towards Object Concept Learning

Understanding objects is a central building block of artificial intelligence, especially for embodied AI. Even though object recognition excels with deep learning, current machines still struggle to learn higher-level knowledge, e.g., what attributes an object has, and what can we do with an object. In this work, we propose a challenging Object Concept Learning (OCL) task to push the envelope of object understanding. It requires machines to reason out object affordances and simultaneously give the reason: what attributes make an object possesses these affordances. To support OCL, we build a densely annotated knowledge base including extensive labels for three levels of object concept (category, attribute, affordance), and the causal relations of three levels. By analyzing the causal structure of OCL, we present a baseline, Object Concept Reasoning Network (OCRN). It leverages causal intervention and concept instantiation to infer the three levels following their causal relations. In experiments, OCRN effectively infers the object knowledge while following the causalities well. Our data and code are available at https://mvig-rhos.com/ocl.

cs.CV↗
arXiv2023

Cosmological neutrino N-body simulations of dark matter halo

The study of massive neutrinos and their interactions is a critical aspect of contemporary cosmology. Recent advances in parallel computation and high-performance computing provide new opportunities for accurately constraining Large-Scale Structures (LSS). In this paper, we introduce the TianNu cosmological N-body simulation during the co-evolution of massive neutrino and cold dark matter components via the CUBEP$^3$M code running on the supercomputer Tianhe-2 and TianNu's connected works. We start by analyzing $2.537\times10^7$ dark halos from the scientific data of TianNu simulation, and compare their angular momentum with the matched halos from neutrino-free TianZero, revealing a dependence of angular momentum modulus on neutrino injection at scales below 50 Mpc and around 10 Mpc.

astro-ph.CO↗
arXiv2023

Ionized gas metallicity of the strong [OIII]λ emission-line compact galaxies in the LAMOST survey

This article reports a sample of 1830 strong [O III] λ5007 emission-line compact galaxies discovered with the LAMOST spectroscopic survey and the photometric catalog of SDSS. We newly identify 402 spectra of 346 strong [O III]λ5007 emission-line compact galaxies by finding compact isolated point sources. Combined with the samples in our previous work (Liu et al. 2022), this returns a sample of 1830 unique strong [O III]λ5007 emission-line compact galaxies with 2033 spectra of z <= 0.53. For the sources with 2σ [OIII]λ4363 detections, we calculate the gas-phase metallicity with the direct-Te method, and verify that the strong-line metallicity diagnostics calibrated with the direct-Te method also applies to this sample. The strong [O III]λ5007 emission-line compact galaxies fall below several Te-calibrated mass-metallicity relations. The N/O measurements of the strong [O iii]λ5007 emission-line compact galaxies mainly locate at a plateau at low metallicity, indicating the product of primary nucleosynthesis. The Ne3O2 and O32 relation follows a tight linear relation with no redshift evolution. The Ne3O2 anti-correlates with the stellar mass, and at fixed stellar mass the Ne3O2 increase with the redshift. Eight sources with asymmetric [O III]λ5007 emission-line profiles have been identified, however with no [O III]λ4363 detection, which proves the rich metal content and complex ionized gas kinematics within the galaxies. Higher-resolution spectroscopy will be necessary to identify the ionized gas components in detail.

astro-ph.GA↗
arXiv2023

The HI gas fraction scaling relation of the Green Pea galaxies

Green Pea galaxies are compact galaxies with high star formation rates. However, limited samples of Green Pea galaxies have HI 21 cm measurements. Whether the HI gas fraction f_{HI} = M_{HI}/M_{*} of Green Pea galaxies follows the existing scaling relations between the f_{HI} and NUV-r color or linear combinations of color and other physical quantities needs checking. Using archival data of HI 21cm observations, we investigate the scaling relation of the NUV-r color with the M_{HI}/M_{*} of 38 Green Pea galaxies, including 17 detections and 21 non-detections. The HI to stellar mass ratios (f_{HI}) of Green Pea galaxies deviate from the polynomial form, where a higher HI gas fraction is predicted given the current NUV-r color, even with the emission lines removed. The blue sources (NUV-r<1) from the comparison sample (ALFALFA-SDSS) follow a similar trend. The HI gas fraction scaling relations with linear combination forms of -0.34(NUV-r) - 0.64 log(mu_{*,z}) + 5.94 and -0.77 log mu_{*,i} + 0.26 log SFR/M_{*}+8.53, better predict the HI gas fraction of the Green Pea galaxies. In order to obtain accurate linear combined forms, higher-resolution photometry from space-based telescopes is needed.

astro-ph.GA↗
arXiv2023

FAST discovery of long tidal tails in NGC 4490/85

We report the discovery of a 100 kpc HI tail in the merging galaxy pair NGC 4490/85 detected by the Five-Hundred-meter Aperture Spherical radio Telescope (FAST). The tidal tails extended in both the south and north directions, and they are much longer than that reported previously based on the VLA interferometric maps. The NGC 4490/85 is surrounded by a large gas envelope, and a starburst low metallicity dwarf galaxy MAPS 1231+42 is found to be connected with the gas envelope, indicating that galaxy interaction trigged the intense star formation in it. Based on the fact that the metallicity in MAPS 1231+42 is one order of magnitude lower than that in the two disks of NGC 4490 and NGC 4485, we speculate that the gas near this galaxy should be primordial and could be due to gas inflow from the circum-galactic medium (CGM). We also found a collimated gas component pointing at a nearby dwarf galaxy KK 149, suggesting that this galaxy might also be interacting with the NGC 4490 pair. We discuss the possible origin of the long tidal tails and the extended gas envelope in this merging system based on the new data from FAST.

astro-ph.GA↗
arXiv2023

Turbocharging Solution Concepts: Solving NEs, CEs and CCEs with Neural Equilibrium Solvers

Solution concepts such as Nash Equilibria, Correlated Equilibria, and Coarse Correlated Equilibria are useful components for many multiagent machine learning algorithms. Unfortunately, solving a normal-form game could take prohibitive or non-deterministic time to converge, and could fail. We introduce the Neural Equilibrium Solver which utilizes a special equivariant neural network architecture to approximately solve the space of all games of fixed shape, buying speed and determinism. We define a flexible equilibrium selection framework, that is capable of uniquely selecting an equilibrium that minimizes relative entropy, or maximizes welfare. The network is trained without needing to generate any supervised training data. We show remarkable zero-shot generalization to larger games. We argue that such a network is a powerful component for many possible multiagent algorithms.

cs.LG↗
arXiv2023

Partial measurements of the total field gradient and the field gradient tensor using an atomic magnetic gradiometer

Magnetic gradiometers have wide practical and academic applications, and two important types of field gradient observables are the total field gradient and field gradient tensor. However, measurements of the field gradient tensor have not been the focus of previous researches on atomic magnetic gradiometers. In this work, we develop an atomic magnetic gradiometer based on two separately optically pumped atomic ensembles in a Herriott-cavity-assisted atomic cell. This gradiometer shows versatile operation modes and functions, and we demonstrate them in measurements of both types of field gradient observables.

physics.atom-ph↗
arXiv2023

A sensitive and stable atomic vector magnetometer for weak field detections using double orthogonal multipass cavities

This paper presents a compact low-temperature atomic vector magnetometer for weak field measurements, using an atomic cell containing two orthogonal multipass cavities. At the working temperature of 75 $^\circ$C, the magnetic field sensitivities at all three axes are better than 45 fT/Hz$^{1/2}$ at 10~Hz limited by photon noise, and 85 fT/Hz$^{1/2}$ at 0.1~Hz. This sensor also shows measurement stabilities better than 1.5~pT at three axes for an integration time of $10^4$ s, even with the laser frequency unlocked. The sensor response to a rotation is demonstrated, which is also developed to measure the effective gyromagnetic ratio of atoms in this sensor when the bias field is nulled. This magnetometer makes an important step towards long-term stable measurements and calibrations of ultra-low fields.

physics.atom-ph↗
arXiv2022

Simplex Neural Population Learning: Any-Mixture Bayes-Optimality in Symmetric Zero-sum Games

Learning to play optimally against any mixture over a diverse set of strategies is of important practical interests in competitive games. In this paper, we propose simplex-NeuPL that satisfies two desiderata simultaneously: i) learning a population of strategically diverse basis policies, represented by a single conditional network; ii) using the same network, learn best-responses to any mixture over the simplex of basis policies. We show that the resulting conditional policies incorporate prior information about their opponents effectively, enabling near optimal returns against arbitrary mixture policies in a game with tractable best-responses. We verify that such policies behave Bayes-optimally under uncertainty and offer insights in using this flexibility at test time. Finally, we offer evidence that learning best-responses to any mixture policies is an effective auxiliary task for strategic exploration, which, by itself, can lead to more performant populations.

cs.AI↗
arXiv2022

Local and global expansion in random geometric graphs

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add $\{i,j,k\}$ and all of its subsets to $X$ if and only if $\langle{\boldsymbol{u_i},\boldsymbol{u_j}}\rangle \ge τ, \langle{\boldsymbol{u_i},\boldsymbol{u_k}}\rangle \ge τ$, and $\langle \boldsymbol{u_j}, \boldsymbol{u_k}\rangle \ge τ$. We prove that for every $\varepsilon > 0$, there exists a choice of $d = Θ(\log n)$ and $τ= τ(\varepsilon,d)$ so that with high probability, $X$ is a high-dimensional expander of average degree $n^\varepsilon$ in which each $1$-link has spectral gap bounded away from $\frac{1}{2}$. To our knowledge, this is the first demonstration of a natural distribution over $2$-dimensional expanders of arbitrarily small polynomial average degree and spectral link expansion better than $\frac{1}{2}$. All previously known constructions are algebraic. This distribution also furnishes an example of simplicial complexes for which the trickle-down theorem is nearly tight. En route, we prove general bounds on the spectral expansion of random induced subgraphs of arbitrary vertex transitive graphs, which may be of independent interest. For example, one consequence is an almost-sharp bound on the second eigenvalue of random $n$-vertex geometric graphs on $\mathbb{S}^{d-1}$, which was previously unknown for most $n,d$ pairs.

math.CO↗
arXiv2022

Developing, Evaluating and Scaling Learning Agents in Multi-Agent Environments

The Game Theory & Multi-Agent team at DeepMind studies several aspects of multi-agent learning ranging from computing approximations to fundamental concepts in game theory to simulating social dilemmas in rich spatial environments and training 3-d humanoids in difficult team coordination tasks. A signature aim of our group is to use the resources and expertise made available to us at DeepMind in deep reinforcement learning to explore multi-agent systems in complex environments and use these benchmarks to advance our understanding. Here, we summarise the recent work of our team and present a taxonomy that we feel highlights many important open challenges in multi-agent research.

cs.MA↗
arXiv2022

Light-shift-free and dead-zone-free atomic orientation based scalar magnetometry using a single amplitude-modulated beam

Detection dead zones and heading errors induced by light shifts are two important problems in optically pumped scalar magnetometry. We introduce an atomic orientation based single-beam magnetometry scheme to simultaneously solve these problems, using a polarization-reversing and path-bending Herriott cavity. Here, a reflection mirror is inserted into the cavity to bend the optical paths in the middle, and divide them into two separated orthogonal regions to avoid the detection dead zone. Moreover, half-wave plates are added in the center of each optical region, so that the light polarization is flipped each time it passes the wave plates and the light shift effects are spatially averaged out. This operation is demonstrated to eliminate the unnoticed heading errors induced by ac light shifts. The methods developed in this paper are robust to use, and easy to be applied in other atomic devices.

physics.atom-ph↗
arXiv2022

Revisiting Gaussian mixture critics in off-policy reinforcement learning: a sample-based approach

Actor-critic algorithms that make use of distributional policy evaluation have frequently been shown to outperform their non-distributional counterparts on many challenging control tasks. Examples of this behavior include the D4PG and DMPO algorithms as compared to DDPG and MPO, respectively [Barth-Maron et al., 2018; Hoffman et al., 2020]. However, both agents rely on the C51 critic for value estimation.One major drawback of the C51 approach is its requirement of prior knowledge about the minimum andmaximum values a policy can attain as well as the number of bins used, which fixes the resolution ofthe distributional estimate. While the DeepMind control suite of tasks utilizes standardized rewards and episode lengths, thus enabling the entire suite to be solved with a single setting of these hyperparameters, this is often not the case. This paper revisits a natural alternative that removes this requirement, namelya mixture of Gaussians, and a simple sample-based loss function to train it in an off-policy regime. We empirically evaluate its performance on a broad range of continuous control tasks and demonstrate that it eliminates the need for these distributional hyperparameters and achieves state-of-the-art performance on a variety of challenging tasks (e.g. the humanoid, dog, quadruped, and manipulator domains). Finallywe provide an implementation in the Acme agent repository.

cs.LG↗
arXiv2022

Code Smells in Machine Learning Systems

As Deep learning (DL) systems continuously evolve and grow, assuring their quality becomes an important yet challenging task. Compared to non-DL systems, DL systems have more complex team compositions and heavier data dependency. These inherent characteristics would potentially cause DL systems to be more vulnerable to bugs and, in the long run, to maintenance issues. Code smells are empirically tested as efficient indicators of non-DL systems. Therefore, we took a step forward into identifying code smells, and understanding their impact on maintenance in this comprehensive study. This is the first study on investigating code smells in the context of DL software systems, which helps researchers and practitioners to get a first look at what kind of maintenance modification made and what code smells developers have been dealing with. Our paper has three major contributions. First, we comprehensively investigated the maintenance modifications that have been made by DL developers via studying the evolution of DL systems, and we identified nine frequently occurred maintenance-related modification categories in DL systems. Second, we summarized five code smells in DL systems. Third, we validated the prevalence, and the impact of our newly identified code smells through a mixture of qualitative and quantitative analysis. We found that our newly identified code smells are prevalent and impactful on the maintenance of DL systems from the developer's perspective.

cs.SE↗