Skip to content

Update URLs for TMLR publication #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
han-xuejun wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Update URLs for TMLR publication #3

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6a0729d
update urls
han-xuejun Jun 3, 2026
e9e1bf4
Merge branch 'main' of https://github.com/manulife-ai/manulife-ai-res…
han-xuejun Jun 3, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 3 additions & 4 deletions _library/2026-tmlr-bandit.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,9 +6,9 @@ venue: "Transactions on Machine Learning Research"
org_unit: "University of Waterloo Partnership"
domains: ["advice"]
authors: "Wei Min Loh, Sajib Kumer Sinha, Ankur Agarwal, Pascal Poupart"
external_url: https://arxiv.org/abs/your-paper-id # TBU
code_url: https://github.com/manulife/your-repo # TBU
pdf_url: https://example.com/paper.pdf # TBU
external_url: https://openreview.net/forum?id=tRbwfej9uY
code_url: https://github.com/wmloh/c3
pdf_url: https://openreview.net/pdf?id=tRbwfej9uY
summary: "This paper introduces conditionally coupled contextual (C3) Thompson Sampling, a method for non‑linear, time‑varying contextual bandits that improves regret and click‑through performance over existing algorithms."
---

Expand All @@ -20,4 +20,3 @@ This paper introduces conditionally coupled contextual (C3) Thompson Sampling, a

**Results:** Empirical results show that C3 outperforms the next best algorithm by 5.7% lower average cumulative regret on four OpenML tabular datasets as well as demonstrating a 12.4% click lift on Microsoft News Dataset (MIND) compared to other algorithms.

*To be published soon*
Loading