31,414 research outputs found
A Survey on Bayesian Deep Learning
A comprehensive artificial intelligence system needs to not only perceive the
environment with different `senses' (e.g., seeing and hearing) but also infer
the world's conditional (or even causal) relations and corresponding
uncertainty. The past decade has seen major advances in many perception tasks
such as visual object recognition and speech recognition using deep learning
models. For higher-level inference, however, probabilistic graphical models
with their Bayesian nature are still more powerful and flexible. In recent
years, Bayesian deep learning has emerged as a unified probabilistic framework
to tightly integrate deep learning and Bayesian models. In this general
framework, the perception of text or images using deep learning can boost the
performance of higher-level inference and in turn, the feedback from the
inference process is able to enhance the perception of text or images. This
survey provides a comprehensive introduction to Bayesian deep learning and
reviews its recent applications on recommender systems, topic models, control,
etc. Besides, we also discuss the relationship and differences between Bayesian
deep learning and other related topics such as Bayesian treatment of neural
networks.Comment: To appear in ACM Computing Surveys (CSUR) 202
Improving the Performance of Recommendation on Social Network by Investigating Interactions of Trust and Interest Similarity
On the social media, lots of people share their experiences through various factors like blogs, online ratings, reviews, online polling and tweets. Study shows that the factors such as interpersonal interest and interpersonal influence from the social media which is based on the circles as well as groups of friends leads to opportunities and challenges in solving the problems on datasets. This challenge is for the Recommender System (RS) to find the solution on cold start and sparsity problems. In this paper, on the basis of the probabilistic matrix factorization, the social factors like personal interest, interpersonal influence and interpersonal interest similarity are combined into a unified personalized recommendation model. These factors can improve the associating linkage in latent space. Various datasets are used to conduct the experiments to get the results that show that the proposed model performs better than the existing approaches
Collaborative Deep Learning for Recommender Systems
Collaborative filtering (CF) is a successful approach commonly used by many
recommender systems. Conventional CF-based methods use the ratings given to
items by users as the sole source of information for learning to make
recommendation. However, the ratings are often very sparse in many
applications, causing CF-based methods to degrade significantly in their
recommendation performance. To address this sparsity problem, auxiliary
information such as item content information may be utilized. Collaborative
topic regression (CTR) is an appealing recent method taking this approach which
tightly couples the two components that learn from two different sources of
information. Nevertheless, the latent representation learned by CTR may not be
very effective when the auxiliary information is very sparse. To address this
problem, we generalize recent advances in deep learning from i.i.d. input to
non-i.i.d. (CF-based) input and propose in this paper a hierarchical Bayesian
model called collaborative deep learning (CDL), which jointly performs deep
representation learning for the content information and collaborative filtering
for the ratings (feedback) matrix. Extensive experiments on three real-world
datasets from different domains show that CDL can significantly advance the
state of the art
Probabilistic Adaptive Computation Time
We present a probabilistic model with discrete latent variables that control
the computation time in deep learning models such as ResNets and LSTMs. A prior
on the latent variables expresses the preference for faster computation. The
amount of computation for an input is determined via amortized maximum a
posteriori (MAP) inference. MAP inference is performed using a novel stochastic
variational optimization method. The recently proposed Adaptive Computation
Time mechanism can be seen as an ad-hoc relaxation of this model. We
demonstrate training using the general-purpose Concrete relaxation of discrete
variables. Evaluation on ResNet shows that our method matches the
speed-accuracy trade-off of Adaptive Computation Time, while allowing for
evaluation with a simple deterministic procedure that has a lower memory
footprint
The Utility of Text: The Case of Amicus Briefs and the Supreme Court
We explore the idea that authoring a piece of text is an act of maximizing
one's expected utility. To make this idea concrete, we consider the societally
important decisions of the Supreme Court of the United States. Extensive past
work in quantitative political science provides a framework for empirically
modeling the decisions of justices and how they relate to text. We incorporate
into such a model texts authored by amici curiae ("friends of the court"
separate from the litigants) who seek to weigh in on the decision, then
explicitly model their goals in a random utility model. We demonstrate the
benefits of this approach in improved vote prediction and the ability to
perform counterfactual analysis.Comment: Working draf
Relational Collaborative Filtering:Modeling Multiple Item Relations for Recommendation
Existing item-based collaborative filtering (ICF) methods leverage only the
relation of collaborative similarity. Nevertheless, there exist multiple
relations between items in real-world scenarios. Distinct from the
collaborative similarity that implies co-interact patterns from the user
perspective, these relations reveal fine-grained knowledge on items from
different perspectives of meta-data, functionality, etc. However, how to
incorporate multiple item relations is less explored in recommendation
research. In this work, we propose Relational Collaborative Filtering (RCF), a
general framework to exploit multiple relations between items in recommender
system. We find that both the relation type and the relation value are crucial
in inferring user preference. To this end, we develop a two-level hierarchical
attention mechanism to model user preference. The first-level attention
discriminates which types of relations are more important, and the second-level
attention considers the specific relation values to estimate the contribution
of a historical item in recommending the target item. To make the item
embeddings be reflective of the relational structure between items, we further
formulate a task to preserve the item relations, and jointly train it with the
recommendation task of preference modeling. Empirical results on two real
datasets demonstrate the strong performance of RCF. Furthermore, we also
conduct qualitative analyses to show the benefits of explanations brought by
the modeling of multiple item relations
- …