360 research outputs found
Automated Machine Learning for Deep Recommender Systems: A Survey
Deep recommender systems (DRS) are critical for current commercial online
service providers, which address the issue of information overload by
recommending items that are tailored to the user's interests and preferences.
They have unprecedented feature representations effectiveness and the capacity
of modeling the non-linear relationships between users and items. Despite their
advancements, DRS models, like other deep learning models, employ sophisticated
neural network architectures and other vital components that are typically
designed and tuned by human experts. This article will give a comprehensive
summary of automated machine learning (AutoML) for developing DRS models. We
first provide an overview of AutoML for DRS models and the related techniques.
Then we discuss the state-of-the-art AutoML approaches that automate the
feature selection, feature embeddings, feature interactions, and system design
in DRS. Finally, we discuss appealing research directions and summarize the
survey
Quantum-Inspired Machine Learning: a Survey
Quantum-inspired Machine Learning (QiML) is a burgeoning field, receiving
global attention from researchers for its potential to leverage principles of
quantum mechanics within classical computational frameworks. However, current
review literature often presents a superficial exploration of QiML, focusing
instead on the broader Quantum Machine Learning (QML) field. In response to
this gap, this survey provides an integrated and comprehensive examination of
QiML, exploring QiML's diverse research domains including tensor network
simulations, dequantized algorithms, and others, showcasing recent
advancements, practical applications, and illuminating potential future
research avenues. Further, a concrete definition of QiML is established by
analyzing various prior interpretations of the term and their inherent
ambiguities. As QiML continues to evolve, we anticipate a wealth of future
developments drawing from quantum mechanics, quantum computing, and classical
machine learning, enriching the field further. This survey serves as a guide
for researchers and practitioners alike, providing a holistic understanding of
QiML's current landscape and future directions.Comment: 56 pages, 13 figures, 8 table
Recommended from our members
Generalised Bayesian matrix factorisation models
Factor analysis and related models for probabilistic matrix factorisation are of central importance to the unsupervised analysis of data, with a colourful history more than a century long. Probabilistic models for matrix factorisation allow us to explore the underlying structure in data, and have relevance in a vast number of application areas including collaborative filtering, source separation, missing data imputation, gene expression analysis, information retrieval, computational finance and computer vision, amongst others. This thesis develops generalisations of matrix factorisation models that advance our understanding and enhance the applicability of this important class of models.
The generalisation of models for matrix factorisation focuses on three concerns: widening the applicability of latent variable models to the diverse types of data that are currently available; considering alternative structural forms in the underlying representations that are inferred; and including higher order data structures into the matrix factorisation framework. These three issues reflect the reality of modern data analysis and we develop new models that allow for a principled exploration and use of data in these settings. We place emphasis on Bayesian approaches to learning and the advantages that come with the Bayesian methodology. Our port of departure is a generalisation of latent variable models to members of the exponential family of distributions. This generalisation allows for the analysis of data that may be real-valued, binary, counts, non-negative or a heterogeneous set of these data types. The model unifies various existing models and constructs for unsupervised settings, the complementary framework to the generalised linear models in regression.
Moving to structural considerations, we develop Bayesian methods for learning sparse latent representations. We define ideas of weakly and strongly sparse vectors and investigate the classes of prior distributions that give rise to these forms of sparsity, namely the scale-mixture of Gaussians and the spike-and-slab distribution. Based on these sparsity favouring priors, we develop and compare methods for sparse matrix factorisation and present the first comparison of these sparse learning approaches. As a second structural consideration, we develop models with the ability to generate correlated binary vectors. Moment-matching is used to allow binary data with specified correlation to be generated, based on dichotomisation of the Gaussian distribution. We then develop a novel and simple method for binary PCA based on Gaussian dichotomisation. The third generalisation considers the extension of matrix factorisation models to multi-dimensional arrays of data that are increasingly prevalent. We develop the first Bayesian model for non-negative tensor factorisation and explore the relationship between this model and the previously described models for matrix factorisation.Supported by a Commonwealth Scholarship awarded by the Commonwealth Scholarship and Fellowship Programme (CSFP) [Award number ZACS-2207-363]
Supported by award from the National Research Foundation, South Africa (NRF) [Award number SFH2007072200001
Perspectives of Nuclear Physics in Europe: NuPECC Long Range Plan 2010
The goal of this European Science Foundation Forward Look into the future of Nuclear Physics is to bring together
the entire Nuclear Physics community in Europe to formulate a coherent plan of the best way to develop the field in
the coming decade and beyond.<p></p>
The primary aim of Nuclear Physics is to understand the origin, evolution, structure and phases of strongly interacting matter, which constitutes nearly 100% of the visible matter in the universe. This is an immensely important and challenging task that requires the concerted effort of scientists working in both theory and experiment, funding agencies, politicians and the public.<p></p>
Nuclear Physics projects are often “big science”, which implies large investments and long lead times. They need careful forward planning and strong support from policy makers. This Forward Look provides an excellent tool to achieve this. It represents the outcome of detailed scrutiny by Europe’s leading experts and will help focus the views of the scientific community on the most promising directions in the field and create the basis for funding agencies to provide adequate support.<p></p>
The current NuPECC Long Range Plan 2010 “Perspectives of Nuclear Physics in Europe” resulted from consultation
with close to 6 000 scientists and engineers over a period of approximately one year. Its detailed recommendations
are presented on the following pages. For the interested public, a short summary brochure has been produced to
accompany the Forward Look.<p></p>
Characterization of Enhanced Interferometric Gravitational Wave Detectors and Studies of Numeric Simulations for Compact-Binary Coalescences
Gravitational waves are a consequence of the general theory of relativity. Direct detection of such waves will provide a wealth of information about physics, astronomy, and cosmology. A worldwide effort is currently underway to make the first direct detection of gravitational waves. The global network of detectors includes the Laser Interferometer Gravitational-wave Observatory (LIGO), which recently completed its sixth science run.
A particularly promising source of gravitational waves is a binary system consisting of two neutron stars and/or black holes. As the objects orbit each other they emit gravitational radiation, lose energy, and spiral inwards. This produces a characteristic ``chirp\u27\u27 signal for which we can search in the LIGO data. Currently this is done using matched-filter techniques, which correlate the detector data against analytic models of the emitted gravitational waves. Several choices must be made in constructing a search for signals from such binary coalescences.
Any discrepancy between the signals and the models used will reduce the effectiveness of the matched filter. However, the analytic models are based on approximations which are not valid through the entire evolution of the binary. In recent years numerical relativity has had impressive success in simulating the final phases of the coalescence of binary black holes. While numerical relativity is too computationally expensive to use directly in the search, this progress has made it possible to perform realistic tests of the LIGO searches. The results of such tests can be used to improve the efficiency of searches.
Conversely, noise in the LIGO and Virgo detectors can reduce the efficiency. This must be addressed by characterizing the quality of the data from the detectors, and removing from the analysis times that will be detrimental to the search.
In this thesis we utilize recent results from numerical relativity to study both the degree to which analytic models match realistic waveforms and the ability of LIGO searches to make detections. We also apply the matched-filter search to the problem of removing times of excess noise from the search
Data-driven Computational Social Science: A Survey
Social science concerns issues on individuals, relationships, and the whole
society. The complexity of research topics in social science makes it the
amalgamation of multiple disciplines, such as economics, political science, and
sociology, etc. For centuries, scientists have conducted many studies to
understand the mechanisms of the society. However, due to the limitations of
traditional research methods, there exist many critical social issues to be
explored. To solve those issues, computational social science emerges due to
the rapid advancements of computation technologies and the profound studies on
social science. With the aids of the advanced research techniques, various
kinds of data from diverse areas can be acquired nowadays, and they can help us
look into social problems with a new eye. As a result, utilizing various data
to reveal issues derived from computational social science area has attracted
more and more attentions. In this paper, to the best of our knowledge, we
present a survey on data-driven computational social science for the first time
which primarily focuses on reviewing application domains involving human
dynamics. The state-of-the-art research on human dynamics is reviewed from
three aspects: individuals, relationships, and collectives. Specifically, the
research methodologies used to address research challenges in aforementioned
application domains are summarized. In addition, some important open challenges
with respect to both emerging research topics and research methods are
discussed.Comment: 28 pages, 8 figure
Research and Education in Computational Science and Engineering
Over the past two decades the field of computational science and engineering
(CSE) has penetrated both basic and applied research in academia, industry, and
laboratories to advance discovery, optimize systems, support decision-makers,
and educate the scientific and engineering workforce. Informed by centuries of
theory and experiment, CSE performs computational experiments to answer
questions that neither theory nor experiment alone is equipped to answer. CSE
provides scientists and engineers of all persuasions with algorithmic
inventions and software systems that transcend disciplines and scales. Carried
on a wave of digital technology, CSE brings the power of parallelism to bear on
troves of data. Mathematics-based advanced computing has become a prevalent
means of discovery and innovation in essentially all areas of science,
engineering, technology, and society; and the CSE community is at the core of
this transformation. However, a combination of disruptive
developments---including the architectural complexity of extreme-scale
computing, the data revolution that engulfs the planet, and the specialization
required to follow the applications to new frontiers---is redefining the scope
and reach of the CSE endeavor. This report describes the rapid expansion of CSE
and the challenges to sustaining its bold advances. The report also presents
strategies and directions for CSE research and education for the next decade.Comment: Major revision, to appear in SIAM Revie
Crowdsensing-driven route optimisation algorithms for smart urban mobility
Urban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling.
Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik.
I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors
rörelseflöden inom stadsmiljön.
Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering.
Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering.
Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer
skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas
- …