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.
This paper improves image retrieval accuracy through novel relevance feedback methods.
Improves relevancy of black-box anomaly detectors with user feedback.
This paper explores a new form of the linear bandit problem in which the algorithm receives the usual stochastic rewards as well as stochastic feedback about which features are relevant to the rewards, the latter feedback being the novel aspect. The focus of this paper is the development of new theory and algorithms fo…
Paper characterizes minimax regret rates for online ranking with top-k feedback.
Research characterizes learnability of multilabel ranking problems.
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 …
Human analysts that use anomaly detection systems in practice want to retain the use of simple and explainable global anomaly detectors. In this paper, we propose a novel human-in-the-loop learning algorithm called GLAD (GLocalized Anomaly Detection) that supports global anomaly detectors. GLAD automatically learns the…
DUET optimizes LLM training data mixtures using feedback from unseen tasks.
REN addresses uncertainty in user feedbacks for better recommendation systems.
Presentation bias is one of the key challenges when learning from implicit feedback in search engines, as it confounds the relevance signal with uninformative signals due to position in the ranking, saliency, and other presentation factors. While it was recently shown how counterfactual learning-to-rank (LTR) approache…
PSEUDo learns patterns in multivariate time series with locality-sensitive hashing and relevance feedback.
Recommender systems widely use implicit feedback such as click data because of its general availability. Although the presence of clicks signals the users' preference to some extent, the lack of such clicks does not necessarily indicate a negative response from the users, as it is possible that the users were not expos…
Algorithm clusters items by sequentially selecting features, minimizing observations.
A new dual test for forward-flatness simplifies computations.
Graph-based approach repairs programs from diagnostic feedback.
Algorithm identifies Copeland winners in dueling bandits with ternary feedback.
Various domain users are increasingly leveraging real-time social media data to gain rapid situational awareness. However, due to the high noise in the deluge of data, effectively determining semantically relevant information can be difficult, further complicated by the changing definition of relevancy by each end user…
We study analytically and numerically Minsky instability as a combination of top-down, bottom-up and peer-to-peer positive feedback loops. The peer-to-peer interactions are represented by the links of a network formed by the connections between firms, contagion leading to avalanches and percolation phase transitions pr…
According to the volatility feedback effect, an unexpected increase in squared volatility leads to an immediate decline in the price-dividend ratio. In this paper, we consider the properties of stock price dynamics and option valuations under the volatility feedback effect by modeling the joint dynamics of stock price,…
We propose Information-Theoretic Active Learning (ITAL), a novel batch-mode active learning method for binary classification, and apply it for acquiring meaningful user feedback in the context of content-based image retrieval. Instead of combining different heuristics such as uncertainty, diversity, or density, our met…
Empirical data reveals that the liquidity flow into the order book (depositions, cancellations andmarket orders) is influenced by past price changes. In particular, we show that liquidity tends todecrease with the amplitude of past volatility and price trends. Such a feedback mechanism inturn increases the volatility, …
The detection of interesting patterns in large high-dimensional datasets is difficult because of their dimensionality and pattern complexity. Therefore, analysts require automated support for the extraction of relevant patterns. In this paper, we present FDive, a visual active learning system that helps to create visua…
E-Commerce (E-Com) search is an emerging important new application of information retrieval. Learning to Rank (LETOR) is a general effective strategy for optimizing search engines, and is thus also a key technology for E-Com search. While the use of LETOR for web search has been well studied, its use for E-Com search h…
The paper tackles Nash-regret minimization in congestion games with bandit feedback.
Relevance ranking and result diversification are two core areas in modern recommender systems. Relevance ranking aims at building a ranked list sorted in decreasing order of item relevance, while result diversification focuses on generating a ranked list of items that covers a broad range of topics. In this paper, we s…
ATPboost is a system for solving sets of large-theory problems by interleaving ATP runs with state-of-the-art machine learning of premise selection from the proofs. Unlike many previous approaches that use multi-label setting, the learning is implemented as binary classification that estimates the pairwise-relevance of…
Meta-algorithm for efficient reinforcement learning from human preferences.
Browsing and finding relevant information for Bangladeshi laws is a challenge faced by all law students and researchers in Bangladesh, and by citizens who want to learn about any legal procedure. Some law archives in Bangladesh are digitized, but lack proper tools to organize the data meaningfully. We present a text vi…
New method clusters items with bandit feedback without parametric assumptions.
This work improves RLHF performance guarantees using greedy sampling.
Latent factor models for Recommender Systems with implicit feedback typically treat unobserved user-item interactions (i.e. missing information) as negative feedback. This is frequently done either through negative sampling (point--wise loss) or with a ranking loss function (pair-- or list--wise estimation). Since a ze…
An interactive image retrieval system learns which images in the database belong to a user's query concept, by analyzing the example images and feedback provided by the user. The challenge is to retrieve the relevant images with minimal user interaction. In this work, we propose to solve this problem by posing it as a …
Algorithm learns diverse rankings for search engines.
We review the evidence that the erratic dynamics of markets is to a large extent of endogenous origin, i.e. determined by the trading activity itself and not due to the rational processing of exogenous news. In order to understand why and how prices move, the joint fluctuations of order flow and liquidity - and the way…
Optimizes ranking from click feedback in a bandit setting.
We propose a continuum model for the description of buyer and seller dynamics in an Internet market. The relevant variables are the research effort of buyers and the sellers' reputation building process. We show that, if a commercial web-site gives consumers the possibility to rate credibly sellers they bargained with,…
Analysis of deep neural networks under various learning rules reveals dynamics of feature and prediction learning.
Agents learn to outperform in trading by using past and current prices.
New method for efficient online exploration in RLHF reduces regret.
In this paper, we study the problem of safe online learning to re-rank, where user feedback is used to improve the quality of displayed lists. Learning to rank has traditionally been studied in two settings. In the offline setting, rankers are typically learned from relevance labels created by judges. This approach has…
Search-oriented conversational systems rely on information needs expressed in natural language (NL). We focus here on the understanding of NL expressions for building keyword-based queries. We propose a reinforcement-learning-driven translation model framework able to 1) learn the translation from NL expressions to que…
This research improves interpretability in sequential explanations using mental models.
Interpretation and explanation of deep models is critical towards wide adoption of systems that rely on them. In this paper, we propose a novel scheme for both interpretation as well as explanation in which, given a pretrained model, we automatically identify internal features relevant for the set of classes considered…
Proposes SSL framework for improving item recommendations in large-scale systems.
New algorithm reduces dynamic regret for noisy gradient feedback with piecewise polynomial comparators.
New budget quantifies drift in closed-loop learning, improving reproducibility.
We propose Style Conditioned Recommendations (SCR) and introduce style injection as a method to diversify recommendations. We use Conditional Variational Autoencoder (CVAE) architecture, where both the encoder and decoder are conditioned on a user profile learned from item content data. This allows us to apply style tr…
In autonomous vehicle (AV) control, allowing mistakes can be quite dangerous and costly in the real world. For this reason we investigate methods of training an AV without allowing the agent to explore and instead having a human explorer collect the data. Supervised learning has been explored for AV control, but it enc…