Algorithm maximizes review quality of least advantaged paper and ensures accurate paper acceptance.
problem Fair and accurate assignment of papers to reviewers in peer review.
method Incremental max-flow procedure for fairness, minimax analysis for accuracy.
result Near-optimal fairness and accuracy of paper assignment.
Review and compare sorting model selection methods for preference disaggregation.
problem Selecting a representative sorting model from multiple compatible models.
method Reviewed and proposed new procedures for selecting sorting models, including robust assignment rule.
result Identified most efficient procedures in terms of classification accuracy and robustness.
The paper tackles strategic review issues in conference settings.
problem Strategic reviews by reviewers who are also authors can bias the ranking of papers.
method The authors present a strategyproof and efficient peer review algorithm based on partitioning.
result The algorithm guarantees strategyproofness and unanimity under certain conditions.
Deep learning predicts ICD codes with high accuracy for patient phenotyping.
problem Variability in ICD code assignment by coders.
method Deep learning model trained on demographics, lab results, and medications.
result Model predictions outperform coder assigned ICD codes in accuracy.
This review covers recent cooperative MARL approaches and their challenges.
problem Recent progress in multi-agent reinforcement learning (MARL).
method Five common approaches: independent learners, fully observable critic, value function factorization, consensus, and learn to communicate.
result Challenges and solutions for each approach are discussed.
The purpose of this paper is to introduce Harvey-Lawson manifolds and review the construction of certain mirror dual Calabi-Yau submanifolds inside a G_2 manifold. More specifically, given a Harvey-Lawson manifold HL, we explain how to assign a pair of tangent bundle valued 2 and 3-forms to a G_2 manifold (M,HL, \varph…
In this paper we present a review of the existing typologies of Internet service users. We zoom in on social networking services including blogs and crowdsourcing websites. Based on the results of the analysis of the considered typologies obtained by means of FCA we developed a new user typology of a certain class of I…
Unified view on selective credit assignment for reinforcement learning.
problem Efficient credit assignment in reinforcement learning.
method Unified temporal-difference algorithms with selective weightings.
result New algorithms for backward credit assignment and off-policy learning.
Same homology via different sign assignments in link Floer theory.
problem Comparing sign assignments in link Floer homology.
method Comparison of sign assignments from two different constructions.
result Small modification of sign convention results in identical chain complexes.
Mean Field Games applied to finance and economics.
problem Modeling large populations in financial and economic systems.
method Mean Field Game theory applied to specific financial and economic scenarios.
result New applications in bitcoin mining, energy markets, and macro-economics.
We consider two areas of research that have been developing in parallel over the last decade: blind source separation (BSS) and electromagnetic source estimation (ESE). BSS deals with the recovery of source signals when only mixtures of signals can be obtained from an array of detectors and the only prior knowledge con…
Pixel-wise classification, where each pixel is assigned to a predefined class, is one of the most important procedures in hyperspectral image (HSI) analysis. By representing a test pixel as a linear combination of a small subset of labeled pixels, a sparse representation classifier (SRC) gives rather plausible results …
New algorithms assign credit to past decisions based on hindsight.
problem Efficient credit assignment in reinforcement learning.
method Explicit credit assignment using new data in hindsight.
result Value functions can be rewritten to include hindsight credit assignment.
Deep learning predicts mismatched ratings in Amazon reviews.
problem Identifying reviews with mismatched ratings on Amazon.
method Converted reviews to vectors using paragraph vector, trained a recurrent neural network with gated recurrent unit, incorporated semantic relationships.
result Model accurately predicts rating mismatches and provides feedback.
The paper proposes a rubric and incentives to prevent peer review from becoming a 'tragedy of the commons'.
problem The growth of machine learning threatens the sustainability of peer review.
method Proposes a rubric for objective review quality and financial compensation for reviewers.
result Avoiding a 'tragedy of the commons' outcome in peer review.
EgalMAB solves fair resource allocation in stochastic bandits.
problem Fair resource allocation in a stochastic multi-armed bandit setting.
method Design and analysis of UCB-based policy EgalUCB.
result Established upper bounds on cumulative regret.
Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms. In this work, we study several different methods of assignment, including the "hard" assignments used by K-means and the ?soft' assignment…
Error bounds based on worst likely assignments use permutation tests to validate classifiers. Worst likely assignments can produce effective bounds even for data sets with 100 or fewer training examples. This paper introduces a statistic for use in the permutation tests of worst likely assignments that improves error b…
In this paper we propose a new method to predict the final destination of vehicle trips based on their initial partial trajectories. We first review how we obtained clustering of trajectories that describes user behaviour. Then, we explain how we model main traffic flow patterns by a mixture of 2d Gaussian distribution…
This paper reviews deep learning techniques for face recognition and sketch matching.
problem Matching composite sketches to photo images of faces is challenging due to limited details.
method Uses deep learning for feature extraction and classification in face recognition.
result Deep learning improves face recognition accuracy with large datasets.
COCOA improves credit assignment in reinforcement learning by measuring contributions to rewards.
problem Improving sample efficiency in reinforcement learning through better credit assignment methods.
method Counterfactual Contribution Analysis (COCOA) for precise credit assignment.
result COCOA achieves lower bias and variance compared to Hindsight Credit Assignment (HCA), improving reinforcement learning performance.
Experiment shows author rankings can improve peer review scores.
problem Improving accuracy in machine learning conference peer review.
method Used Isotonic Mechanism to calibrate review scores using author rankings.
result Calibrated scores outperform raw scores in estimating ground truth review scores.
Patient journeys are compared to find clusters of similar disease trajectories.
problem Discovering shared health outcomes among patient journeys.
method Comparing longitudinal health data to identify clusters of similar patient trajectories.
result Clusters of patient journeys with similar health outcomes can be identified.
New method uses information bottleneck to quantify variable importance in neural networks.
problem Quantifying the importance of individual input variables in neural networks.
method Restricting the flow of information by adding noise to intermediate feature maps.
result Our method outperforms all baselines in five out of six settings.
Online reviews provided by consumers are a valuable asset for e-Commerce platforms, influencing potential consumers in making purchasing decisions. However, these reviews are of varying quality, with the useful ones buried deep within a heap of non-informative reviews. In this work, we attempt to automatically identify…
New methods optimize personalized treatment assignment in trials with many arms.
problem Poor performance of standard methods in trials with many treatment arms.
method Regularized and clustered joint assignment forest algorithm.
result Gains in predicting arm-wise outcomes and utility gains from personalization.
Unsupervised summarization generates novel reviews reflecting consensus opinions.
problem Creating summaries that reflect subjective information in multiple documents.
method Generative model with hierarchical variational autoencoder, pointer-generator mechanism.
result Model produces fluent and coherent summaries reflecting common opinions.
The paper explores how missing data problems are related to causal inference.
problem Missing data in experiments makes causal inference difficult.
method The paper reinterprets missing data as a form of causal inference by considering counterfactual variables.
result Identification assumptions in missing data can be encoded using graphical models of counterfactual and observed variables.
Proposes unbiased estimators for training mixture of experts models.
problem Efficiently training large-scale mixture of experts models on modern hardware.
method Two unbiased estimators based on principled stochastic assignment procedures.
result Both estimators are more effective and robust than biased alternatives.
Neural Information Processing Systems (NIPS) is a top-tier annual conference in machine learning. The 2016 edition of the conference comprised more than 2,400 paper submissions, 3,000 reviewers, and 8,000 attendees. This represents a growth of nearly 40% in terms of submissions, 96% in terms of reviewers, and over 100%…
Mathematical general relativity reviewed.
problem Challenges in mathematical modeling of general relativity.
method Selected topics reviewed.
result Insights into mathematical models of general relativity.
Paper quarantines unreliable Yelp users by detecting review spam.
problem Unreliable and spamming users deceive Yelp's users.
method Used RSD and spam detection techniques on key features.
result More than 80% of Yelp's accounts are unreliable, and highly-rated businesses are often spammed.
Optimizes balanced treatment assignment for experiments.
problem Balancing treatment groups in experiments for optimal results.
method Optimization of a two-sample test, using minimum spanning tree test.
result Optimal assignment algorithm with polynomial time complexity.
Systematically compares methods for explaining RNN predictions.
problem Understanding the decisions of RNNs, particularly LSTMs, through relevance assignments.
method Systematic comparison of methods in various settings.
result Best method reveals linguistic phenomena in sentiment analysis.
Low-rank matrix estimation from incomplete measurements recently received increased attention due to the emergence of several challenging applications, such as recommender systems; see in particular the famous Netflix challenge. While the behaviour of algorithms based on nuclear norm minimization is now well understood…
The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data. A leading design paradigm for this is the convolution kernel, which decomposes structured objects into their parts and sums over all pairs of parts. Assignment kernels, in contrast, are ob…
Paper detects review abuse using tensor decomposition.
problem Detecting review abuse by sellers and reviewers.
method Semi-supervised binary multi-target tensor decomposition.
result The model achieves higher precision and recall.
Online reviews provide viewpoints on the strengths and shortcomings of products/services, influencing potential customers' purchasing decisions. However, the proliferation of non-credible reviews -- either fake (promoting/ demoting an item), incompetent (involving irrelevant aspects), or biased -- entails the problem o…
ProMP improves Meta-RL by better handling credit assignment.
problem Poor credit assignment in Meta-RL leads to suboptimal performance.
method Develops a novel meta-learning algorithm controlling pre-adaptation and adapted policies.
result Significantly improves sample-efficiency and asymptotic performance.
Paper uses pre-trained models and active learning to analyze customer reviews quickly.
problem Automatic review analysis with limited labeled data and time.
method Pre-trained language representation and active learning framework.
result Fully automatic review analysis achieved at a faster pace.
A new Q&A labeling method for assigning labels in machine learning.
problem Assigning labels to instances in supervised machine learning.
method Developed a Q&A labeling method involving a question generator and an annotator.
result The derived label generative model is consistent with previous studies.
Study compares methods for treatment assignment, finding A-learner best for playlist generation.
problem Treatment assignment in various applications.
method Three classes of algorithms: O-learner, E-learner, A-learner.
result Optimizing for outcomes or causal effects does not lead to optimal treatment assignments.
This letter tackles channel assignment in uplink wireless communication systems.
problem Maximizing the sum rate of all users in uplink wireless communication systems with integer channel assignment constraints.
method A convex optimization based algorithm is used to find the optimal channel assignment. Machine learning approaches, including CNNs, FNNs, random forest, and GRUs, are employed to reduce computation time.
result Machine learning methods largely reduce computation time with slightly compromised prediction accuracy.
Solves partial assignment problems using random clique complexes.
problem Partial assignment problems, especially with severe occlusions and distortions.
method Formulate as matching random clique complexes, analyze k-skeletons, match adjacency matrices, consider geometric neighbourhoods.
result Outperforms diverse matching algorithms significantly.
We consider the problem of learning soft assignments of N items to K categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity mat…
Linear-time algorithm for optimal assignment in graph matching.
problem Finding optimal assignments between graph vertices efficiently.
method Developed an algorithm for linear-time optimal assignment using tree distances.
result Approximated edit distance between graphs in linear time.
Study on optimal rates for sequential probability assignment using smoothed analysis.
problem Optimal rates for sequential probability assignment under smoothed adversaries.
method General-purpose reduction from minimax rates to transductive learning, development of an efficient algorithm using MLE oracle.
result Optimal (logarithmic) fast rates for parametric and finite VC dimension classes, sublinear regret for general classes.
ScoreGAN uses GANs with IGM to detect bot-generated reviews based on text and scores.
problem Lack of labeled data and bot-generated reviews in fraud review detection.
method ScoreGAN incorporates review text and scores into a GAN framework for data augmentation and detection.
result ScoreGAN outperforms existing methods by 7% and 5% on Yelp and TripAdvisor datasets.