Search Results for author: Su Jia

Found 9 papers, 1 papers with code

Multi-Armed Bandits with Interference

no code implementations2 Feb 2024 Su Jia, Peter Frazier, Nathan Kallus

Prior research on experimentation with interference has concentrated on the final output of a policy.

Multi-Armed Bandits

Clustered Switchback Experiments: Near-Optimal Rates Under Spatiotemporal Interference

no code implementations25 Dec 2023 Su Jia, Nathan Kallus, Christina Lee Yu

We consider experimentation in the presence of non-stationarity, inter-unit (spatial) interference, and carry-over effects (temporal interference), where we wish to estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control.

Experimental Design

Optimal Decision Tree with Noisy Outcomes

1 code implementation NeurIPS 2019 Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi

In pool-based active learning, the learner is given an unlabeled data set and aims to efficiently learn the unknown hypothesis by querying the labels of the data points.

Active Learning

Short-lived High-volume Multi-A(rmed)/B(andits) Testing

no code implementations23 Dec 2023 Su Jia, Andrew Li, R. Ravi, Nishant Oli, Paul Duff, Ian Anderson

We aim to minimize the loss due to not knowing the mean rewards, averaged over instances generated from a given prior distribution.

Markdown Pricing Under an Unknown Parametric Demand Model

no code implementations23 Dec 2023 Su Jia, Andrew Li, R. Ravi

Without monotonicity, the minimax regret is $\tilde O(n^{2/3})$ for the Lipschitz demand family and $\tilde O(n^{1/2})$ for a general class of parametric demand models.

From Stream to Pool: Dynamic Pricing Beyond i.i.d. Arrivals

no code implementations30 Oct 2023 Titing Cui, Su Jia, Thomas Lavastida

The dynamic pricing problem has been extensively studied under the \textbf{stream} model: A stream of customers arrives sequentially, each with an independently and identically distributed valuation.

Smooth Non-Stationary Bandits

no code implementations29 Jan 2023 Su Jia, Qian Xie, Nathan Kallus, Peter I. Frazier

In many applications of online decision making, the environment is non-stationary and it is therefore crucial to use bandit algorithms that handle changes.

Decision Making

Greedy Approximation Algorithms for Active Sequential Hypothesis Testing

no code implementations NeurIPS 2021 Kyra Gan, Su Jia, Andrew Li

In the problem of active sequential hypothesis testing (ASHT), a learner seeks to identify the true hypothesis from among a known set of hypotheses.

Input Aggregated Network for Face Video Representation

no code implementations22 Mar 2016 Zhen Dong, Su Jia, Chi Zhang, Mingtao Pei

To sufficiently discover the useful information contained in face videos, we present a novel network architecture called input aggregated network which is able to learn fixed-length representations for variable-length face videos.

Cannot find the paper you are looking for? You can Submit a new open access paper.