arXiv subjects

Yifei Jin

Publications and source records attributed to Yifei Jin.

42 records · Page 3Linked to original sources

arXiv2018

The SAMI Galaxy Survey: Data Release Two with absorption-line physics value-added products

We present the second major release of data from the SAMI Galaxy Survey. Data Release Two includes data for 1559 galaxies, about 50% of the full survey. Galaxies included have a redshift range 0.004 < z < 0.113 and a large stellar mass range 7.5 < log (M_star/M_sun) < 11.6. The core data for each galaxy consist of two primary spectral cubes covering the blue and red optical wavelength ranges. For each primary cube we also provide three spatially binned spectral cubes and a set of standardised aperture spectra. For each core data product we provide a set of value-added data products. This includes all emission line value-added products from Data Release One, expanded to the larger sample. In addition we include stellar kinematic and stellar population value-added products derived from absorption line measurements. The data are provided online through Australian Astronomical Optics' Data Central. We illustrate the potential of this release by presenting the distribution of ~350,000 stellar velocity dispersion measurements from individual spaxels as a function of R/R_e, divided in four galaxy mass bins. In the highest stellar mass bin (log (M_star/M_sun)>11), the velocity dispersion strongly increases towards the centre, whereas below log (M_star/M_sun)<10 we find no evidence for a clear increase in the central velocity dispersion. This suggests a transition mass around log (M_star/M_sun) ~10 for galaxies with or without a dispersion-dominated bulge.

astro-ph.GA↗

arXiv2018

Odd Yao-Yao Graphs are Not Spanners

It is a long standing open problem whether Yao-Yao graphs $\mathsf{YY}_{k}$ are all spanners [li2002sparse]. Bauer and Damian [bauer2013infinite] showed that all $\mathsf{YY}_{6k}$ for $k \geq 6$ are spanners. Li and Zhan [li2016almost] generalized their result and proved that all even Yao-Yao graphs $\mathsf{YY}_{2k}$ are spanners (for $k\geq 42$). However, their technique cannot be extended to odd Yao-Yao graphs, and whether they are spanners are still elusive. In this paper, we show that, surprisingly, for any integer $k \geq 1$, there exist odd Yao-Yao graph $\mathsf{YY}_{2k+1}$ instances, which are not spanners.

cs.CG↗

arXiv2018

SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms

We study two important SVM variants: hard-margin SVM (for linearly separable cases) and $ν$-SVM (for linearly non-separable cases). We propose new algorithms from the perspective of saddle point optimization. Our algorithms achieve $(1-ε)$-approximations with running time $\tilde{O}(nd+n\sqrt{d / ε})$ for both variants, where $n$ is the number of points and $d$ is the dimensionality. To the best of our knowledge, the current best algorithm for $ν$-SVM is based on quadratic programming approach which requires $Ω(n^2 d)$ time in worst case~\cite{joachims1998making,platt199912}. In the paper, we provide the first nearly linear time algorithm for $ν$-SVM. The current best algorithm for hard margin SVM achieved by Gilbert algorithm~\cite{gartner2009coresets} requires $O(nd / ε)$ time. Our algorithm improves the running time by a factor of $\sqrt{d}/\sqrtε$. Moreover, our algorithms can be implemented in the distributed settings naturally. We prove that our algorithms require $\tilde{O}(k(d +\sqrt{d/ε}))$ communication cost, where $k$ is the number of clients, which almost matches the theoretical lower bound. Numerical experiments support our theory and show that our algorithms converge faster on high dimensional, large and dense data sets, as compared to previous methods.

cs.LG↗

arXiv2017

Improved Algorithms For Structured Sparse Recovery

It is known that certain structures of the signal in addition to the standard notion of sparsity (called structured sparsity) can improve the sample complexity in several compressive sensing applications. Recently, Hegde et al. proposed a framework, called approximation-tolerant model-based compressive sensing, for recovering signals with structured sparsity. Their framework requires two oracles, the head- and the tail-approximation projection oracles. The two oracles should return approximate solutions in the model which is closest to the query signal. In this paper, we consider two structured sparsity models and obtain improved projection algorithms. The first one is the tree sparsity model, which captures the support structure in the wavelet decomposition of piecewise-smooth signals. We propose a linear time $(1-ε)$-approximation algorithm for head-approximation projection and a linear time $(1+ε)$-approximation algorithm for tail-approximation projection. The best previous result is an $\tilde{O}(n\log n)$ time bicriterion approximation algorithm (meaning that their algorithm may return a solution of sparsity larger than $k$) by Hegde et al. Our result provides an affirmative answer to the open problem mentioned in the survey of Hegde and Indyk. As a corollary, we can recover a constant approximate $k$-sparse signal. The other is the Constrained Earth Mover Distance (CEMD) model, which is useful to model the situation where the positions of the nonzero coefficients of a signal do not change significantly as a function of spatial (or temporal) locations. We obtain the first single criterion constant factor approximation algorithm for the head-approximation projection. The previous best known algorithm is a bicriterion approximation. Using this result, we can get a faster constant approximation algorithm with fewer measurements for the recovery problem in CEMD model.

cs.IT↗

arXiv2016

SDSS-IV MaNGA: Properties of galaxies with kinematically decoupled stellar and gaseous components

We study the properties of 66 galaxies with kinematically misaligned gas and stars from MaNGA survey. The fraction of kinematically misaligned galaxies varies with galaxy physical parameters, i.e. M*, SFR and sSFR. According to their sSFR, we further classify these 66 galaxies into three categories, 10 star-forming, 26 "Green Valley" and 30 quiescent ones. The properties of different types of kinematically misaligned galaxies are different in that the star-forming ones have positive gradient in D4000 and higher gas-phase metallicity, while the green valley/quiescent ones have negative D4000 gradients and lower gas-phase metallicity on average. There is evidence that all types of the kinematically misaligned galaxies tend to live in more isolated environment. Based on all these observational results, we propose a scenario for the formation of star forming galaxies with kinematically misaligned gas and stars - the progenitor accretes misaligned gas from a gas-rich dwarf or cosmic web, the cancellation of angular momentum from gas-gas collisions between the pre-existing gas and the accreted gas largely accelerates gas inflow, leading to fast centrally-concentrated star-formation. The higher metallicity is due to enrichment from this star formation. For the kinematically misaligned green valley and quiescent galaxies, they might be formed through gas-poor progenitors accreting kinematically misaligned gas from satellites which are smaller in mass.

astro-ph.GA↗

arXiv2016

A PTAS for the Weighted Unit Disk Cover Problem

We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of disks of minimum total weight that covers all given points. \UDC\ is one of the geometric set cover problems, which have been studied extensively for the past two decades (for many different geometric range spaces, such as (unit) disks, halfspaces, rectangles, triangles). It is known that the unweighted \UDC\ problem is NP-hard and admits a polynomial-time approximation scheme (PTAS). For the weighted \UDC\ problem, several constant approximations have been developed. However, whether the problem admits a PTAS has been an open question. In this paper, we answer this question affirmatively by presenting the first PTAS for \UDC. Our result implies the first PTAS for the minimum weight dominating set problem in unit disk graphs. Combining with existing ideas, our result can also be used to obtain the first PTAS for the maxmimum lifetime coverage problem and an improved constant approximation ratio for the connected dominating set problem in unit disk graphs.

cs.CG↗