English
Related papers

Related papers: Recommandation mobile, sensible au contexte de con…

200 papers

Motivated by, e.g., sensitivity analysis and end-to-end learning, the demand for differentiable optimization algorithms has been significantly increasing. In this paper, we establish a theoretically guaranteed versatile framework that makes…

Data Structures and Algorithms · Computer Science 2020-06-15 Shinsaku Sakaue

Utilizing the capabilities of configurable sensing systems requires addressing difficult information gathering problems. Near-optimal approaches exist for sensing systems without internal states. However, when it comes to optimizing the…

Systems and Control · Computer Science 2013-09-24 Nikolay Atanasov , Jerome Le Ny , Kostas Daniilidis , George J. Pappas

We study the problem of contextual dynamic pricing with a linear demand model. We propose a novel localized exploration-then-commit (LetC) algorithm which starts with a pure exploration stage, followed by a refinement stage that explores…

Machine Learning · Statistics 2024-12-30 Jinhang Chai , Yaqi Duan , Jianqing Fan , Kaizheng Wang

Recommender system research has oftentimes focused on approaches that operate on large-scale datasets containing millions of user interactions. However, many small businesses struggle to apply state-of-the-art models due to their very…

The emergence of smartphones has given mobile computing access to everyday reality. More specifically, the context modeling offers users an effective way to customize search results and even the recommended elements by limiting the data…

Information Retrieval · Computer Science 2018-09-27 Imen Ben Sassi

We generalize the problem of online submodular welfare maximization to incorporate various stochastic elements that have gained significant attention in recent years. We show that a non-adaptive Greedy algorithm, which is oblivious to the…

Data Structures and Algorithms · Computer Science 2026-01-06 Rajan Udwani

This paper considers a discrete-time decision problem wherein a decision maker has to track, on average, a sequence of inputs selected from a convex set $\mathcal X \subset \mathbb{R}^d$ by choosing actions from a possibly non-convex…

Optimization and Control · Mathematics 2018-11-20 Andrey Bernstein , Niek J. Bouman

Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult…

Machine Learning · Statistics 2018-12-18 Maria Dimakopoulou , Zhengyuan Zhou , Susan Athey , Guido Imbens

Active learning strategies respond to the costly labelling task in a supervised classification by selecting the most useful unlabelled examples in training a predictive model. Many conventional active learning algorithms focus on refining…

Machine Learning · Computer Science 2014-08-12 Djallel Bouneffouf

In this work, we introduce the notion of Context-Based Prediction Models. A Context-Based Prediction Model determines the probability of a user's action (such as a click or a conversion) solely by relying on user and contextual features,…

Information Retrieval · Computer Science 2023-08-03 Jan Hartman , Assaf Klein , Davorin Kopič , Natalia Silberstein

Personalized web services strive to adapt their services (advertisements, news articles, etc) to individual users by making use of both content and user information. Despite a few recent advances, this problem remains challenging for at…

Machine Learning · Computer Science 2012-03-05 Lihong Li , Wei Chu , John Langford , Robert E. Schapire

Human affordance learning investigates contextually relevant novel pose prediction such that the estimated pose represents a valid human action within the scene. While the task is fundamental to machine perception and automated interactive…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Prasun Roy , Saumik Bhattacharya , Subhankar Ghosh , Umapada Pal , Michael Blumenstein

Online resource allocation problems are central challenges in economics and computer science, modeling situations in which $n$ items arriving one at a time must each be immediately allocated among $m$ agents. In such problems, our objective…

Data Structures and Algorithms · Computer Science 2025-10-14 Kalen Patton

We consider information filtering, in which we face a stream of items too voluminous to process by hand (e.g., scientific articles, blog posts, emails), and must rely on a computer system to automatically filter out irrelevant items. Such…

Optimization and Control · Mathematics 2015-02-10 Xiaoting Zhao , Peter I. Frazier

Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-18 Bradley R. Lowery , Julien Langou

We consider an agent who is involved in a Markov decision process and receives a vector of outcomes every round. Her objective is to maximize a global concave reward function on the average vectorial outcome. The problem models applications…

Machine Learning · Computer Science 2019-05-17 Wang Chi Cheung

The paper presents a machine learning approach to design digital interfaces that can dynamically adapt to different users and usage strategies. The algorithm uses Bayesian statistics to model users' browsing behavior, focusing on their…

Machine Learning · Computer Science 2025-09-24 Eric Petit , Denis Chêne

Explore-and-exploit tradeoffs play a key role in recommendation systems (RSs), aiming at serving users better by learning from previous interactions. Despite their commercial success, the societal effects of explore-and-exploit mechanisms…

Computer Science and Game Theory · Computer Science 2025-02-19 Omer Ben-Porat , Yotam Gafni , Or Markovetzki

Many robotic tasks in real-world environments require physical interactions with an object such as pick up or push. For successful interactions, the robot needs to know the object's affordances, which are defined as the potential actions…

Robotics · Computer Science 2025-01-13 Paula Wulkop , Halil Umut Özdemir , Antonia Hüfner , Jen Jen Chung , Roland Siegwart , Lionel Ott

We design and implement an adaptive experiment (a ``contextual bandit'') to learn a targeted treatment assignment policy, where the goal is to use a participant's survey responses to determine which charity to expose them to in a donation…

‹ Prev 1 4 5 6 7 8 10 Next ›