We propose Top-N-Rank, a novel family of list-wise Learning-to-Rank models for reliably recommending the N top-ranked items. The proposed models optimize a variant of the widely used discounted cumulative gain (DCG) objective function which differs from DCG in two important aspects: (i) It limits the evaluation of DCG …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
38 results for “top-N”
Extends homotopical theory to locally compact groups, refining their compactness properties.
problem Developing homotopical invariants for locally compact groups.
method Extending classical theory of homotopical -sets to locally compact Hausdorff groups, defining sets of characters.
result Recovering and generalizing classical results on characters and compactness properties of groups.
The importance of accurate recommender systems has been widely recognized by academia and industry. However, the recommendation quality is still rather low. Recently, a linear sparse and low-rank representation of the user-item matrix has been applied to produce Top-N recommendations. This approach uses the nuclear nor…
Top-N recommender systems have been investigated widely both in industry and academia. However, the recommendation quality is far from satisfactory. In this paper, we propose a simple yet promising algorithm. We fill the user-item matrix based on a low-rank assumption and simultaneously keep the original information. T…
Hyperbolic geometry autoencoder outperforms Euclidean in top-N recommendation tasks.
problem Top-N recommendation performance using hyperbolic geometry.
method Simple autoencoder based on hyperbolic geometry with a single hidden layer.
result Outperforms Euclidean models and state-of-the-art methods.
Reservoir subspace injection improves online ICA by preserving injected features.
problem Discarding injected features in top- whitening can degrade performance.
method Formalized reservoir subspace injection (RSI) and developed diagnostics (IER, SSO, ρ_x) to identify and mitigate the failure mode.
result RSI controller preserves passthrough retention, improving performance by up to 2.2 dB.
Knowledge distillation (KD) is a well-known method to reduce inference latency by compressing a cumbersome teacher model to a small student model. Despite the success of KD in the classification task, applying KD to recommender models is challenging due to the sparsity of positive feedback, the ambiguity of missing fee…
Recommending appropriate items to users is crucial in many e-commerce platforms that contain implicit data as users' browsing, purchasing and streaming history. One common approach consists in selecting the N most relevant items to each user, for a given N, which is called top-N recommendation. To do so, recommender sy…
A new method for generating sets and graphs without requiring exchangeability.
problem Generating exchangeable distributions for sets and graphs is challenging.
method Top-n creation, a differentiable generation mechanism that selects relevant points from a latent vector.
result Top-n method outperforms i.i.d. generation in various tasks.
The purpose if this master's thesis is to study and develop a new algorithmic framework for Collaborative Filtering to produce recommendations in the top-N recommendation problem. Thus, we propose Lanczos Latent Factor Recommender (LLFR); a novel "big data friendly" collaborative filtering algorithm for top-N recommend…
Data poisoning attacks can manipulate recommender systems to recommend target items.
problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.
The smoothing theory is revised to generalize to different disc embedding spaces.
problem Generalizing the smoothing theory to various disc embedding spaces.
method Revising the Morlet-Burghelea-Lashof-Kirby-Siebenmann theorem to apply to different versions of disc smooth embedding spaces.
result The delooping of disc embedding spaces is shown to be compatible with the Hatcher and Budney actions.
How to Put Users in Control of their Data in Federated Top-N Recommendation with Learning to Rankcs.LG
FPL allows users to control their data in federated top-N recommendation.
problem Data privacy in recommendation services.
method Federated Learning with learning to rank optimization.
result Users can control the amount of sensitive data shared with a central server.
Collaborative filtering (CF) is a popular technique in today's recommender systems, and matrix approximation-based CF methods have achieved great success in both rating prediction and top-N recommendation tasks. However, real-world user-item rating matrices are typically sparse, incomplete and noisy, which introduce ch…
Fifty Shades of Ratings: How to Benefit from a Negative Feedback in Top-N Recommendations Taskscs.LG
Conventional collaborative filtering techniques treat a top-n recommendations problem as a task of generating a list of the most relevant items. This formulation, however, disregards an opposite - avoiding recommendations with completely irrelevant items. Due to that bias, standard algorithms, as well as commonly used …
Normalized nonnegative models assign probability distributions to users and random variables to items; see [Stark, 2015]. Rating an item is regarded as sampling the random variable assigned to the item with respect to the distribution assigned to the user who rates the item. Models of that kind are highly expressive. F…
Recommending new items to existing users has remained a challenging problem due to absence of user's past preferences for these items. The user personalized non-collaborative methods based on item features can be used to address this item cold-start problem. These methods rely on similarities between the target item an…
A new portfolio model DEWSP improves Sharpe ratio by 0.24% to 5.15%.
problem High sensitivity of optimized portfolios to estimation errors.
method Deep learning algorithms predict returns for top-N ranked assets, then equally weight them.
result DEWSPs provide an improvement rate of 0.24% to 5.15% in terms of monthly Sharpe ratio compared to HEWSPs.
This work explores non-negative low-rank matrix factorization based on regularized Poisson models (PF or "Poisson factorization" for short) for recommender systems with implicit-feedback data. The properties of Poisson likelihood allow a shortcut for very fast computations over zero-valued inputs, and oftentimes result…
KANEL: Kolmogorov-Arnold Network Ensemble Learning Enables Early Hit Enrichment in High-Throughput Virtual Screeningphysics.chem-ph
KANEL combines models for early hit enrichment in virtual screening.
problem Assessing model accuracy in chemical bioactivity predictions.
method Ensemble workflow using Kolmogorov-Arnold Networks (KANs) and other models.
result Improves early hit enrichment metrics like PPV@N.
Paper tackles zero-shot activity recognition using video features and text embeddings.
problem Zero-shot activity recognition with videos.
method Auto-encoder model for multimodal joint embedding, 3D convolutional action recognition for visual features, GloVe word embeddings for textual features.
result Improved zero-shot recognition results with top-n accuracy and mean Nearest Neighbor Overlap.
We study parameter estimation in Nonlinear Factor Analysis (NFA) where the generative model is parameterized by a deep neural network. Recent work has focused on learning such models using inference (or recognition) networks; we identify a crucial problem when modeling large, sparse, high-dimensional datasets -- underf…
Most accurate recommender systems are black-box models, hiding the reasoning behind their recommendations. Yet explanations have been shown to increase the user's trust in the system in addition to providing other benefits such as scrutability, meaning the ability to verify the validity of recommendations. This gap bet…
Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods. In this work we tackle this problem by exploiting the innately hierarchical structure of the item space following an approach inspired by the theory of Decomposability. W…
FID misaligns with human judgment due to reliance on ImageNet classes.
problem FID metric's reliance on ImageNet classes causes discrepancies with human evaluation.
method Investigated and visualized the feature space of FID and its relation to ImageNet classes.
result Aligning histograms of Top- ImageNet classifications can reduce FID without improving quality.
Unweighted matrix factorization can match or outperform weighted methods in recommender systems.
problem Improving recommendation performance with matrix factorization on implicit feedback data.
method Systematic study of various weighting schemes and matrix factorization algorithms.
result Training with unweighted data can perform comparably to, and sometimes outperform, training with weighted data.
A new method selects important variables for clustering from dependency networks.
problem Variable selection for clustering in high-cost data scenarios.
method Create dependency networks, rank variables by centrality, select top-n variables.
result Top-n variables improve clustering performance compared to existing methods.
The study proposes an audit to assess user control over recommendations in collaborative filtering systems.
problem The gap between maximizing accuracy and ensuring user control over information availability in recommender systems.
method The approach involves a computationally efficient audit for top- linear recommender models, focusing on reachability and user agency.
result The study demonstrates that model complexity affects the effort required for users to exert control over their recommendations.
Recently, matrix factorization-based recommendation methods have been criticized for the problem raised by the triangle inequality violation. Although several metric learning-based approaches have been proposed to overcome this issue, existing approaches typically project each user to a single point in the metric space…
Company2Vec creates embeddings from company websites for fine-grained business analytics.
problem Lack of fine-grained company labels for analytics.
method Word2Vec and dimensionality reduction on company website data.
result Semantic company embeddings for various applications.
Unified approach to equity markets with open and hybrid Jacobi models.
problem Stochastic Portfolio Theory problems in equity markets.
method Combining open markets and hybrid Jacobi processes.
result Stability of capital distribution curve and growth optimal strategies.
Gestalt combines two models to improve SQuAD2.0 performance.
problem Improving the accuracy of answering questions in context paragraphs.
method A stacking ensemble of ALBERT and RoBERTa models, combined with a CNN-based meta-model.
result Best ensemble achieved 87.117 EM and 90.306 F1 scores, improving baseline by 0.55% and 0.61% respectively.
An empirical investigation of active/continuous authentication for smartphones is presented in this paper by exploiting users' unique application usage data, i.e., distinct patterns of use, modeled by a Markovian process. Variations of Hidden Markov Models (HMMs) are evaluated for continuous user verification, and chal…
We implement a method for re-ranking top-10 results of a state-of-the-art question answering (QA) system. The goal of our re-ranking approach is to improve the answer selection given the user question and the top-10 candidates. We focus on improving deployed QA systems that do not allow re-training or re-training comes…
Collaborative filtering is widely used in modern recommender systems. Recent research shows that variational autoencoders (VAEs) yield state-of-the-art performance by integrating flexible representations from deep neural networks into latent variable models, mitigating limitations of traditional linear factor models. V…
Beyond Keywords and Relevance: A Personalized Ad Retrieval Framework in E-Commerce Sponsored Searchcs.IR
On most sponsored search platforms, advertisers bid on some keywords for their advertisements (ads). Given a search request, ad retrieval module rewrites the query into bidding keywords, and uses these keywords as keys to select Top N ads through inverted indexes. In this way, an ad will not be retrieved even if querie…
News recommender systems are aimed to personalize users experiences and help them to discover relevant articles from a large and dynamic search space. Therefore, news domain is a challenging scenario for recommendations, due to its sparse user profiling, fast growing number of items, accelerated item's value decay, and…
New method uses rank-conditioned Horvitz-Thompson estimation for unbiased sample reuse in Plackett-Luce best-of-K objective.
problem Estimating the expected maximum reward in Plackett-Luce draws without replacement.
method Rank-conditioned Horvitz-Thompson estimation with joint-score REINFORCE for unbiased sample reuse.
result Unbiased estimation of the Plackett-Luce best-of-K objective with finite second moment guarantees.