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.
New method learns from either positive or negative feedback alone.
Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services. The vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy. In this paper…
Social media systems rely on user feedback and rating mechanisms for personalization, ranking, and content filtering. However, when users evaluate content contributed by fellow users (e.g., by liking a post or voting on a comment), these evaluations create complex social feedback effects. This paper investigates how ra…
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 …
Adaptive sampler improves recommendation for implicit feedback data.
We apply the potential force estimation method to artificial time series of market price produced by a deterministic dealer model. We find that dealers' feedback of linear prediction of market price based on the latest mean price changes plays the central role in the market's potential force. When markets are dominated…
Proposes a method to train classifiers with delayed feedback using a time window.
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…
Implicit feedback is the simplest form of user feedback that can be used for item recommendation. It is easy to collect and domain independent. However, there is a lack of negative examples. Existing works circumvent this problem by making various assumptions regarding the unconsumed items, which fail to hold when the …
Semi-supervised method enhances recommendation from sparse data.
FAWMF adapts weights for implicit feedback recommendation efficiently.
By combining (i) the economic theory of rational expectation bubbles, (ii) behavioral finance on imitation and herding of investors and traders and (iii) the mathematical and statistical physics of bifurcations and phase transitions, the log-periodic power law (LPPL) model has been developed as a flexible tool to detec…
In display advertising, predicting the conversion rate, that is, the probability that a user takes a predefined action on an advertiser's website, such as purchasing goods is fundamental in estimating the value of displaying the advertisement. However, there is a relatively long time delay between a click and its resul…
FA algorithm provides convergence guarantees for deep linear networks.
Self-reinforcing feedback loops in personalization systems are typically caused by users choosing from a limited set of alternatives presented systematically based on previous choices. We propose a Bayesian choice model built on Luce axioms that explicitly accounts for users' limited exposure to alternatives. Our model…
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…
Negative user preference is an important context that is not sufficiently utilized by many existing recommender systems. This context is especially useful in scenarios where the cost of negative items is high for the users. In this work, we describe a new recommender algorithm that explicitly models negative user prefe…
This paper extends combinatorial semi-bandits to graph feedback, improving regret bounds.
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 study an online classification problem with partial feedback in which individuals arrive one at a time from a fixed but unknown distribution, and must be classified as positive or negative. Our algorithm only observes the true label of an individual if they are given a positive classification. This setting captures …
Multimodal analysis assesses job interview performance and provides feedback.
Study stabilizes second-order systems to first-order dynamics.
Study identifies new stable climate states in climate model.
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…
AutoStan improves Bayesian models via predictive feedback.
Study online control of unknown time-varying systems with negative and positive results.
New oracle uses uncertainty for active classification with noisy feedback.
We introduce the concept of "negative bubbles" as the mirror image of standard financial bubbles, in which positive feedback mechanisms may lead to transient accelerating price falls. To model these negative bubbles, we adapt the Johansen-Ledoit-Sornette (JLS) model of rational expectation bubbles with a hazard rate de…
Work shows hallucination detection by LLMs is impossible without expert feedback.
Bayesian Markowitz portfolio problem shows entropy regularization is ineffective.
In this paper, we apply a mini-batch based negative sampling method to efficiently train a latent factor autoencoder model on large scale and sparse data for implicit feedback collaborative filtering. We compare our work against a state-of-the-art baseline model on different experimental datasets and show that this met…
Last-iterate guarantees for learning in co-coercive games under noisy feedback.
Predicting conversion rates (CVRs) in display advertising (e.g., predicting the proportion of users who purchase an item (i.e., a conversion) after its corresponding ad is clicked) is important when measuring the effects of ads shown to users and to understanding the interests of the users. There is generally a time de…
IAL uses interactive learning to improve model performance with minimal human feedback.
We consider in a market model the cooperative emergence of value due to a positive feedback between perception of needs and demand. Here we consider also a negative feedback from production of the traded products, and find that this cooperativity is robust, provided that the production rate is slow. Cooperativity is fo…
Study on when RLVR can learn compositional problems.
DisCor corrects reinforcement learning issues by re-weighting collected data.
Bayesian method mitigates negative transfer in unknown source data.
In this paper, we propose a novel ranking framework for collaborative filtering with the overall aim of learning user preferences over items by minimizing a pairwise ranking loss. We show the minimization problem involves dependent random variables and provide a theoretical analysis by proving the consistency of the em…
In many machine learning scenarios, supervision by gold labels is not available and consequently neural models cannot be trained directly by maximum likelihood estimation (MLE). In a weak supervision scenario, metric-augmented objectives can be employed to assign feedback to model outputs, which can be used to extract …
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…
Exact asymptotic solutions found for nonlinear Hawkes processes.
Following a Geometrical Brownian Motion extension into an Irrational Fractional Brownian Motion model, we re-examine agent behaviour reacting to time dependent news on the log-returns thereby modifying a financial market evolution. We specifically discuss the role of financial news or economic information positive or n…
In this paper, we show synchronization for a group of output passive agents that communicate with each other according to an underlying communication graph to achieve a common goal. We propose a distributed event-triggered control framework that will guarantee synchronization and considerably decrease the required comm…
New algorithm tackles multi-armed bandit with arbitrary delays and general bounded losses.
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…
New insights into cascade feedback linearization of control systems.
User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is oft…