Searcharxiv⌕ Search

arXiv subjects

Jeffrey Chan

Publications and source records attributed to Jeffrey Chan.

At least 55 records · Page 3Linked to original sources

Measuring disentangled generative spatio-temporal representation

Disentangled representation learning offers useful properties such as dimension reduction and interpretability, which are essential to modern deep learning approaches. Although deep learning techniques have been widely applied to spatio-temporal data mining, there has been little attention to further disentangle the latent features and understanding their contribution to the model performance, particularly their mutual information and correlation across features. In this study, we adopt two state-of-the-art disentangled representation learning methods and apply them to three large-scale public spatio-temporal datasets. To evaluate their performance, we propose an internal evaluation metric focusing on the degree of correlations among latent variables of the learned representations and the prediction performance of the downstream tasks. Empirical results show that our modified method can learn disentangled representations that achieve the same level of performance as existing state-of-the-art ST deep learning methods in a spatio-temporal sequence forecasting problem. Additionally, we find that our methods can be used to discover real-world spatial-temporal semantics to describe the variables in the learned representation.

cs.LG↗

Learning Enhanced Optimisation for Routing Problems

Deep learning approaches have shown promising results in solving routing problems. However, there is still a substantial gap in solution quality between machine learning and operations research algorithms. Recently, another line of research has been introduced that fuses the strengths of machine learning and operational research algorithms. In particular, search perturbation operators have been used to improve the solution. Nevertheless, using the perturbation may not guarantee a quality solution. This paper presents "Learning to Guide Local Search" (L2GLS), a learning-based approach for routing problems that uses a penalty term and reinforcement learning to adaptively adjust search efforts. L2GLS combines local search (LS) operators' strengths with penalty terms to escape local optimals. Routing problems have many practical applications, often presetting larger instances that are still challenging for many existing algorithms introduced in the learning to optimise field. We show that L2GLS achieves the new state-of-the-art results on larger TSP and CVRP over other machine learning methods.

cs.AI↗

MoParkeR : Multi-objective Parking Recommendation

Existing parking recommendation solutions mainly focus on finding and suggesting parking spaces based on the unoccupied options only. However, there are other factors associated with parking spaces that can influence someone's choice of parking such as fare, parking rule, walking distance to destination, travel time, likelihood to be unoccupied at a given time. More importantly, these factors may change over time and conflict with each other which makes the recommendations produced by current parking recommender systems ineffective. In this paper, we propose a novel problem called multi-objective parking recommendation. We present a solution by designing a multi-objective parking recommendation engine called MoParkeR that considers various conflicting factors together. Specifically, we utilise a non-dominated sorting technique to calculate a set of Pareto-optimal solutions, consisting of recommended trade-off parking spots. We conduct extensive experiments using two real-world datasets to show the applicability of our multi-objective recommendation methodology.

cs.IR↗

Learning Vehicle Routing Problems using Policy Optimisation

Deep reinforcement learning (DRL) has been used to learn effective heuristics for solving complex combinatorial optimisation problem via policy networks and have demonstrated promising performance. Existing works have focused on solving (vehicle) routing problems as they have a nice balance between non-triviality and difficulty. State-of-the-art approaches learn a policy using reinforcement learning, and the learnt policy acts as a pseudo solver. These approaches have demonstrated good performance in some cases, but given the large search space typical combinatorial/routing problem, they can converge too quickly to poor policy. To prevent this, in this paper, we propose an approach name entropy regularised reinforcement learning (ERRL) that supports exploration by providing more stochastic policies, which tends to improve optimisation. Empirically, the low variance ERRL offers RL training fast and stable. We also introduce a combination of local search operators during test time, which significantly improves solution and complement ERRL. We qualitatively demonstrate that for vehicle routing problems, a policy with higher entropy can make the optimisation landscape smooth which makes it easier to optimise. The quantitative evaluation shows that the performance of the model is comparable with the state-of-the-art variants. In our evaluation, we experimentally illustrate that the model produces state-of-the-art performance on variants of Vehicle Routing problems such as Capacitated Vehicle Routing Problem (CVRP), Multiple Routing with Fixed Fleet Problems (MRPFF) and Travelling Salesman problem.

cs.LG↗

Divide and Learn: A Divide and Conquer Approach for Predict+Optimize

The predict+optimize problem combines machine learning ofproblem coefficients with a combinatorial optimization prob-lem that uses the predicted coefficients. While this problemcan be solved in two separate stages, it is better to directlyminimize the optimization loss. However, this requires dif-ferentiating through a discrete, non-differentiable combina-torial function. Most existing approaches use some form ofsurrogate gradient. Demirovicet alshowed how to directlyexpress the loss of the optimization problem in terms of thepredicted coefficients as a piece-wise linear function. How-ever, their approach is restricted to optimization problemswith a dynamic programming formulation. In this work wepropose a novel divide and conquer algorithm to tackle op-timization problems without this restriction and predict itscoefficients using the optimization loss. We also introduce agreedy version of this approach, which achieves similar re-sults with less computation. We compare our approach withother approaches to the predict+optimize problem and showwe can successfully tackle some hard combinatorial problemsbetter than other predict+optimize methods.

cs.LG↗

Representing and Denoising Wearable ECG Recordings

Modern wearable devices are embedded with a range of noninvasive biomarker sensors that hold promise for improving detection and treatment of disease. One such sensor is the single-lead electrocardiogram (ECG) which measures electrical signals in the heart. The benefits of the sheer volume of ECG measurements with rich longitudinal structure made possible by wearables come at the price of potentially noisier measurements compared to clinical ECGs, e.g., due to movement. In this work, we develop a statistical model to simulate a structured noise process in ECGs derived from a wearable sensor, design a beat-to-beat representation that is conducive for analyzing variation, and devise a factor analysis-based method to denoise the ECG. We study synthetic data generated using a realistic ECG simulator and a structured noise model. At varying levels of signal-to-noise, we quantitatively measure an upper bound on performance and compare estimates from linear and non-linear models. Finally, we apply our method to a set of ECGs collected by wearables in a mobile health study.

stat.ML↗

Learning to Optimise General TSP Instances

The Travelling Salesman Problem (TSP) is a classical combinatorial optimisation problem. Deep learning has been successfully extended to meta-learning, where previous solving efforts assist in learning how to optimise future optimisation instances. In recent years, learning to optimise approaches have shown success in solving TSP problems. However, they focus on one type of TSP problem, namely ones where the points are uniformly distributed in Euclidean spaces and have issues in generalising to other embedding spaces, e.g., spherical distance spaces, and to TSP instances where the points are distributed in a non-uniform manner. An aim of learning to optimise is to train once and solve across a broad spectrum of (TSP) problems. Although supervised learning approaches have shown to achieve more optimal solutions than unsupervised approaches, they do require the generation of training data and running a solver to obtain solutions to learn from, which can be time-consuming and difficult to find reasonable solutions for harder TSP instances. Hence this paper introduces a new learning-based approach to solve a variety of different and common TSP problems that are trained on easier instances which are faster to train and are easier to obtain better solutions. We name this approach the non-Euclidean TSP network (NETSP-Net). The approach is evaluated on various TSP instances using the benchmark TSPLIB dataset and popular instance generator used in the literature. We performed extensive experiments that indicate our approach generalises across many types of instances and scales to instances that are larger than what was used during training.

cs.LG↗

The GOGREEN and GCLASS Surveys: First Data Release

We present the first public data release of the GOGREEN and GCLASS surveys of galaxies in dense environments, spanning a redshift range $0.8<z<1.5$. The surveys consist of deep, multiwavelength photometry and extensive Gemini GMOS spectroscopy of galaxies in 26 overdense systems ranging in halo mass from small groups to the most massive clusters. The objective of both projects was primarily to understand how the evolution of galaxies is affected by their environment, and to determine the physical processes that lead to the quenching of star formation. There was an emphasis on obtaining unbiased spectroscopy over a wide stellar mass range ($M\gtrsim 2\times 10^{10}~\mathrm{M}_\odot$), throughout and beyond the cluster virialized regions. The final spectroscopic sample includes 2771 unique objects, of which 2257 have reliable spectroscopic redshifts. Of these, 1704 have redshifts in the range $0.8<z<1.5$, and nearly 800 are confirmed cluster members. Imaging spans the full optical and near-infrared wavelength range, at depths comparable to the UltraVISTA survey, and includes \textit{HST}/WFC3 F160W (GOGREEN) and F140W (GCLASS). This data release includes fully reduced images and spectra, with catalogues of advanced data products including redshifts, line strengths, star formation rates, stellar masses and rest-frame colours. Here we present an overview of the data, including an analysis of the spectroscopic completeness and redshift quality.

astro-ph.GA↗

The H$α$ star formation main sequence in cluster and field galaxies at $z\sim1.6$

We calculate H$α$-based star formation rates and determine the star formation rate-stellar mass relation for members of three SpARCS clusters at $z \sim 1.6$ and serendipitously identified field galaxies at similar redshifts to the clusters. We find similar star formation rates in cluster and field galaxies throughout our range of stellar masses. The results are comparable to those seen in other clusters at similar redshifts, and consistent with our previous photometric evidence for little quenching activity in clusters. One possible explanation for our results is that galaxies in our $z \sim 1.6$ clusters have been accreted too recently to show signs of environmental quenching. It is also possible that the clusters are not yet dynamically mature enough to produce important environmental quenching effects shown to be important at low redshift, such as ram pressure stripping or harassment.

astro-ph.GA↗

Joint Modelling of Cyber Activities and Physical Context to Improve Prediction of Visitor Behaviors

This paper investigates the Cyber-Physical behavior of users in a large indoor shopping mall by leveraging anonymized (opt in) Wi-Fi association and browsing logs recorded by the mall operators. Our analysis shows that many users exhibit a high correlation between their cyber activities and their physical context. To find this correlation, we propose a mechanism to semantically label a physical space with rich categorical information from DBPedia concepts and compute a contextual similarity that represents a user's activities with the mall context. We demonstrate the application of cyber-physical contextual similarity in two situations: user visit intent classification and future location prediction. The experimental results demonstrate that exploitation of contextual similarity significantly improves the accuracy of such applications.

cs.IR↗

Less is More: Rejecting Unreliable Reviews for Product Question Answering

Promptly and accurately answering questions on products is important for e-commerce applications. Manually answering product questions (e.g. on community question answering platforms) results in slow response and does not scale. Recent studies show that product reviews are a good source for real-time, automatic product question answering (PQA). In the literature, PQA is formulated as a retrieval problem with the goal to search for the most relevant reviews to answer a given product question. In this paper, we focus on the issue of answerability and answer reliability for PQA using reviews. Our investigation is based on the intuition that many questions may not be answerable with a finite set of reviews. When a question is not answerable, a system should return nil answers rather than providing a list of irrelevant reviews, which can have significant negative impact on user experience. Moreover, for answerable questions, only the most relevant reviews that answer the question should be included in the result. We propose a conformal prediction based framework to improve the reliability of PQA systems, where we reject unreliable answers so that the returned results are more concise and accurate at answering the product question, including returning nil answers for unanswerable questions. Experiments on a widely used Amazon dataset show encouraging results of our proposed framework. More broadly, our results demonstrate a novel and effective application of conformal methods to a retrieval task.

cs.CL↗

The kinematics of massive quiescent galaxies at $1.4 < z < 2.1$: dark matter fractions, IMF variation, and the relation to local early-type galaxies

We study the dynamical properties of massive quiescent galaxies at $1.4 < z < 2.1$ using deep Hubble Space Telescope WFC3/F160W imaging and a combination of literature stellar velocity dispersion measurements and new near-infrared spectra obtained using KMOS on the ESO VLT. We use these data to show that the typical dynamical-to-stellar mass ratio has increased by $\sim$0.2 dex from $z = 2$ to the present day, and investigate this evolution in the context of possible changes in the stellar initial mass function (IMF) and/or fraction of dark matter contained within the galaxy effective radius, $f_\mathrm{DM}$. Comparing our high-redshift sample to their likely descendants at low-redshift, we find that $f_\mathrm{DM}$ has increased by a factor of more than 4 since $z \approx 1.8$, from $f_\mathrm{DM}$ = $6.6\pm1.0$% to $\sim$24%. The observed increase appears robust to changes in the methods used to estimate dynamical masses or match progenitors and descendants. We quantify possible variation of the stellar IMF through the offset parameter $α$, defined as the ratio of dynamical mass in stars to the stellar mass estimated using a Chabrier IMF. We demonstrate that the correlation between stellar velocity dispersion and $α$ reported among quiescent galaxies at low-redshift is already in place at $z = 2$, and argue that subsequent evolution through (mostly minor) merging should act to preserve this relation while contributing significantly to galaxies overall growth in size and stellar mass.

astro-ph.GA↗

An Ambient-Physical System to Infer Concentration in Open-plan Workplace

One of the core challenges in open-plan workspaces is to ensure a good level of concentration for the workers while performing their tasks. Hence, being able to infer concentration levels of workers will allow building designers, managers, and workers to estimate what effect different open-plan layouts will have and to find an optimal one. In this research, we present an ambient-physical system to investigate the concentration inference problem. Specifically, we deploy a series of pervasive sensors to capture various ambient and physical signals related to perceived concentration at work. The practicality of our system has been tested on two large open-plan workplaces with different designs and layouts. The empirical results highlight promising applications of pervasive sensing in occupational concentration inference, which can be adopted to enhance the capabilities of modern workplaces.

cs.CY↗

Flight Delay Prediction using Airport Situational Awareness Map

The prediction of flight delays plays a significantly important role for airlines and travelers because flight delays cause not only tremendous economic loss but also potential security risks. In this work, we aim to integrate multiple data sources to predict the departure delay of a scheduled flight. Different from previous work, we are the first group, to our best knowledge, to take advantage of airport situational awareness map, which is defined as airport traffic complexity (ATC), and combine the proposed ATC factors with weather conditions and flight information. Features engineering methods and most state-of-the-art machine learning algorithms are applied to a large real-world data sources. We reveal a couple of factors at the airport which has a significant impact on flight departure delay time. The prediction results show that the proposed factors are the main reasons behind the flight delays. Using our proposed framework, an improvement in accuracy for flight departure delay prediction is obtained.

cs.CY↗

Alternative Blockmodelling

Many approaches have been proposed to discover clusters within networks. Community finding field encompasses approaches which try to discover clusters where nodes are tightly related within them but loosely related with nodes of other clusters. However, a community network configuration is not the only possible latent structure in a graph. Core-periphery and hierarchical network configurations are valid structures to discover in a relational dataset. On the other hand, a network is not completely explained by only knowing the membership of each node. A high level view of the inter-cluster relationships is needed. Blockmodelling techniques deal with these two issues. Firstly, blockmodelling allows finding any network configuration besides to the well-known community structure. Secondly, blockmodelling is a summary representation of a network which regards not only membership of nodes but also relations between clusters. Finally, a unique summary representation of a network is unlikely. Networks might hide more than one blockmodel. Therefore, our proposed problem aims to discover a secondary blockmodel representation of a network that is of good quality and dissimilar with respect to a given blockmodel. Our methodology is presented through two approaches, (a) inclusion of cannot-link constraints and (b) dissimilarity between image matrices. Both approaches are based on non-negative matrix factorisation NMF which fits the blockmodelling representation. The evaluation of these two approaches regards quality and dissimilarity of the discovered alternative blockmodel as these are the requirements of the problem.

cs.SI↗

The Evolution and Origin of Ionized Gas Velocity Dispersion from $z\sim2.6$ to $z\sim0.6$ with KMOS$^{\rm 3D}$

We present the $0.6<z<2.6$ evolution of the ionized gas velocity dispersion in 175 star-forming disk galaxies based on data from the full KMOS$^{\rm 3D}$ integral field spectroscopic survey. In a forward-modelling Bayesian framework including instrumental effects and beam-smearing, we fit simultaneously the observed galaxy velocity and velocity dispersion along the kinematic major axis to derive the intrinsic velocity dispersion $σ_0$. We find a reduction of the average intrinsic velocity dispersion of disk galaxies as a function of cosmic time, from $σ_0\sim45$ km s$^{-1}$ at $z\sim2.3$ to $σ_0\sim30$ km s$^{-1}$ at $z\sim0.9$. There is substantial intrinsic scatter ($σ_{σ_0, {\rm int}}\approx10$ km s$^{-1}$) around the best-fit $σ_0-z$-relation beyond what can be accounted for from the typical measurement uncertainties ($δσ_0\approx12$ km s$^{-1}$), independent of other identifiable galaxy parameters. This potentially suggests a dynamic mechanism such as minor mergers or variation in accretion being responsible for the scatter. Putting our data into the broader literature context, we find that ionized and atomic+molecular velocity dispersions evolve similarly with redshift, with the ionized gas dispersion being $\sim10-15$ km s$^{-1}$ higher on average. We investigate the physical driver of the on average elevated velocity dispersions at higher redshift, and find that our galaxies are at most marginally Toomre-stable, suggesting that their turbulent velocities are powered by gravitational instabilities, while stellar feedback as a driver alone is insufficient. This picture is supported through comparison with a state-of-the-art analytical model of galaxy evolution.

astro-ph.GA↗

Approximating Optimisation Solutions for Travelling Officer Problem with Customised Deep Learning Network

Deep learning has been extended to a number of new domains with critical success, though some traditional orienteering problems such as the Travelling Salesman Problem (TSP) and its variants are not commonly solved using such techniques. Deep neural networks (DNNs) are a potentially promising and under-explored solution to solve these problems due to their powerful function approximation abilities, and their fast feed-forward computation. In this paper, we outline a method for converting an orienteering problem into a classification problem, and design a customised multi-layer deep learning network to approximate traditional optimisation solutions to this problem. We test the performance of the network on a real-world parking violation dataset, and conduct a generic study that empirically shows the critical architectural components that affect network performance for this problem.

cs.LG↗

A Likelihood-Free Inference Framework for Population Genetic Data using Exchangeable Neural Networks

An explosion of high-throughput DNA sequencing in the past decade has led to a surge of interest in population-scale inference with whole-genome data. Recent work in population genetics has centered on designing inference methods for relatively simple model classes, and few scalable general-purpose inference techniques exist for more realistic, complex models. To achieve this, two inferential challenges need to be addressed: (1) population data are exchangeable, calling for methods that efficiently exploit the symmetries of the data, and (2) computing likelihoods is intractable as it requires integrating over a set of correlated, extremely high-dimensional latent variables. These challenges are traditionally tackled by likelihood-free methods that use scientific simulators to generate datasets and reduce them to hand-designed, permutation-invariant summary statistics, often leading to inaccurate inference. In this work, we develop an exchangeable neural network that performs summary statistic-free, likelihood-free inference. Our framework can be applied in a black-box fashion across a variety of simulation-based tasks, both within and outside biology. We demonstrate the power of our approach on the recombination hotspot testing problem, outperforming the state-of-the-art.

cs.LG↗