Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nicholas Boyd

dblp:132/9297 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Information extraction and text analysis · 42% Representation and self-supervised learning · 37% Probabilistic and Bayesian machine learning · 21%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.312017
Saturating Splines and Feature Selection · J. Mach. Learn. Res. 2017
Natural language and speech › Information extraction and text analysis › topic model
latent dirichlet allocation
0.212013
Streaming Variational Bayes · NIPS 2013
Natural language and speech › Information extraction and text analysis
topic model
0.212013
Streaming Variational Bayes · NIPS 2013
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.212013
Streaming Variational Bayes · NIPS 2013
Mathematical optimization › regularization
sparse regularization
0.112017
Saturating Splines and Feature Selection · J. Mach. Learn. Res. 2017
Distributed systems › asynchronous systems
asynchronous computation
0.012013
Streaming Variational Bayes · NIPS 2013
Distributed systems
distributed machine learning
0.012013
Streaming Variational Bayes · NIPS 2013

Methods — techniques the papers use, named apart from their topics

regularization · 0.6variational bayes · 0.3stochastic variational inference · 0.3expectation-maximization · 0.3splines · 0.3spline · 0.3
YearPublicationVenuePosition
2017 Crowdsourcing-Based Musical Predictions
abstract
Data is becoming more and more valuable as technology advances. Through crowdsourcing organizations are able to collect large amounts of data at an effective rate with little cost. This paper proposes a crowdsourcing-based music playing system, where the next song to play is determined by the listening preferences of realtime online users. Unlike conventional radio play system, where songs are randomly selected, our system selects songs which satisfies the listening preferences of a majority of users, who are currently online. Our system consists of two important components: a predictor, which estimates a user's listening preferences based on his features, and a decision maker, which selects the next song to play based on a majority vote. In order to find out the relationship between user features and listening preferences, K-means algorithm is adopted. A large amount of real data is collected via online surveys, and extension simulations show that our system can effectively selects a proper song for its online audience.
Nicholas Boyd, Wei Chang 0001, Jie Wu 0001
MASS1
2017 Saturating Splines and Feature Selection
Nicholas Boyd, Trevor J. Hastie, Stephen P. Boyd, Benjamin Recht, Michael I. Jordan
J. Mach. Learn. Res.1
2013 Streaming Variational Bayes
abstract
We present SDA-Bayes, a framework for (S)treaming, (D)istributed, (A)synchronous computation of a Bayesian posterior. The framework makes streaming updates to the estimated posterior according to a user-specified approximation primitive function. We demonstrate the usefulness of our framework, with variational Bayes (VB) as the primitive, by fitting the latent Dirichlet allocation model to two large-scale document collections. We demonstrate the advantages of our algorithm over stochastic variational inference (SVI), both in the single-pass setting SVI was designed for and in the streaming setting, to which SVI does not apply.
Tamara Broderick, Nicholas Boyd, Andre Wibisono, Ashia Wilson, Michael I. Jordan
NIPS2