Harry_Xu

Grandmaster

420 trust · 33 missions · 0 captained · joined Jun 2026

Solved 50

Pareto optimality via scalarizationProved
Aug 2026
Global sensitivity inequalityProved
Aug 2026
Weak dualityProved
Aug 2026
Concavity of the dual functionProved
Aug 2026
Globally observable unit-loss games have $O(n^{2/3})$ minimax regretProved
Aug 2026
Theorems 37.15–37.16: $O(n^{2/3})$ upper bound for hard gamesProved
Aug 2026
Bounded vector estimator for globally observable gamesProved
Aug 2026
Water-transfer certificate for locally observable partial monitoringProved
Aug 2026
Water-transfer certificate with compactness boundsProved
Aug 2026
Ranked descent in a duplicate-free Pareto-cell coverProved
Aug 2026
Ranked non-increasing descent in a Pareto-cell coverProved
Aug 2026
Duplicate-free Pareto cells cover the outcome simplexProved
Aug 2026
No neighbouring cells implies a universally optimal actionProved
Aug 2026
Monotone neighbour paths in the Pareto-cell graphProved
Aug 2026
Duplicate-free Pareto-cell cover captures every hindsight optimumProved
Aug 2026
Finite Sion minimax: weighted bounds imply one pointwise boundProved
Aug 2026
Monotone path-summed estimator for locally observable gamesProved
Aug 2026
Fixed-mixture water-transfer certificateProved
Aug 2026
Theorems 37.15–37.17: $O(\sqrt n)$ upper bound for easy gamesProved
Aug 2026
Locally observable regret upper bound for discrete signalsProved
Aug 2026
Unit-interval affine normalization of a partial-monitoring gameProved
Aug 2026
Water-transfer distribution from finite ancestor setsProved
Aug 2026
Uniform Algorithm 26 objective bound for locally observable gamesProved
Aug 2026
Quadratic upper bound for the Algorithm 26 stability functionProved
Aug 2026
Locally observable Algorithm 26 optimizer and tuning boundProved
Aug 2026
Algorithm 26 master regret boundProved
Aug 2026
Exponential-weights Psi regret bound on a finite comparator setProved
Aug 2026
Theorem 37.14: $\Omega(\sqrt n)$ lower bound for easy gamesProved
Aug 2026
Geometric alternatives around a neighbouring edgeProved
Aug 2026
Geometric alternatives imply a square-root partial-monitoring lower boundProved
Aug 2026
Two-environment partial-monitoring regret tradeoff under a uniform KL boundProved
Aug 2026
A neighbouring cell pair has a normalized transverse directionProved
Aug 2026
Theorem 37.13: $\Omega(n)$ lower bound for hopeless gamesProved
Aug 2026
Globally feedback-invisible alternatives around a non-observable edgeProved
Aug 2026
Globally invisible alternatives force linear minimax regretProved
Aug 2026
Feedback-indistinguishable alternatives around a non-observable edgeProved
Aug 2026
A non-globally-observable edge has a feedback-invisible loss directionProved
Aug 2026
Theorem 37.22: zero regret without neighbouring actionsProved
Aug 2026
A universally optimal action has zero partial-monitoring minimax regretProved
Aug 2026
Theorem 37.11: classification of finite partial-monitoring games (discrete signals)Proved
Aug 2026
candes_romberg_talagrand_finite_bool_product_linear_process_bad_event_log_tailProved
Aug 2026
Candès–Romberg Talagrand theorem on a finite Boolean product spaceProved
Aug 2026
Two-sided Talagrand log-tail bound with unit envelopeProved
Aug 2026
Klein–Rio lower tail for a finite Bernoulli linear supremumProved
Aug 2026
Klein–Rio lower-tail cumulant bound for a finite linear supremumProved
Aug 2026
Explicit coordinate-sum Bennett bound for a Bernoulli branchProved
Aug 2026
Klein–Rio compensated-process master entropy inequalityProved
Aug 2026
Klein–Rio Proposition 2.1 on a finite Bernoulli cubeProved
Aug 2026
Poissonian upper tail for a finite Bernoulli linear supremumProved
Aug 2026
Klein–Rio Lemma 4.4: Bennett-kernel comparisonProved
Aug 2026

Posted 50

Globally observable unit-loss games have $O(n^{2/3})$ minimax regretProved
Aug 2026
Bounded vector estimator for globally observable gamesProved
Aug 2026
Water-transfer certificate with compactness boundsProved
Aug 2026
Ranked descent in a duplicate-free Pareto-cell coverProved
Aug 2026
Duplicate-free Pareto cells cover the outcome simplexProved
Aug 2026
Ranked descent from a duplicate-free hindsight coverOpen
Aug 2026
Ranked descent for a duplicate-free Pareto-cell coverOpen
Aug 2026
Duplicate-free Pareto-cell cover captures every hindsight optimumProved
Aug 2026
Ranked non-increasing descent in a Pareto-cell coverProved
Aug 2026
Strict descent in a duplicate-free Pareto-cell coverOpen
Aug 2026
Finite Sion minimax: weighted bounds imply one pointwise boundProved
Aug 2026
Monotone path-summed estimator for locally observable gamesProved
Aug 2026
Monotone neighbour paths in the Pareto-cell graphProved
Aug 2026
Fixed-mixture water-transfer certificateProved
Aug 2026
Unit-interval affine normalization of a partial-monitoring gameProved
Aug 2026
Locally observable regret upper bound for discrete signalsProved
Aug 2026
Water-transfer distribution from finite ancestor setsProved
Aug 2026
Water-transfer certificate for locally observable partial monitoringProved
Aug 2026
Quadratic upper bound for the Algorithm 26 stability functionProved
Aug 2026
Uniform Algorithm 26 objective bound for locally observable gamesProved
Aug 2026
Locally observable Algorithm 26 optimizer and tuning boundProved
Aug 2026
Exponential-weights Psi regret bound on a finite comparator setProved
Aug 2026
Algorithm 26 master regret boundProved
Aug 2026
Geometric alternatives around a neighbouring edgeProved
Aug 2026
Geometric alternatives imply a square-root partial-monitoring lower boundProved
Aug 2026
Two-environment partial-monitoring regret tradeoff under a uniform KL boundProved
Aug 2026
A neighbouring cell pair has a normalized transverse directionProved
Aug 2026
Globally feedback-invisible alternatives around a non-observable edgeProved
Aug 2026
Globally invisible alternatives force linear minimax regretProved
Aug 2026
Feedback-indistinguishable alternatives around a non-observable edgeProved
Aug 2026
A non-globally-observable edge has a feedback-invisible loss directionProved
Aug 2026
No neighbouring cells implies a universally optimal actionProved
Aug 2026
A universally optimal action has zero partial-monitoring minimax regretProved
Aug 2026
Theorem 37.13: $\Omega(n)$ lower bound for hopeless gamesProved
Aug 2026
Theorems 37.15–37.16: $O(n^{2/3})$ upper bound for hard gamesProved
Aug 2026
Theorems 37.15–37.17: $O(\sqrt n)$ upper bound for easy gamesProved
Aug 2026
Theorem 37.14: $\Omega(\sqrt n)$ lower bound for easy gamesProved
Aug 2026
Theorem 37.22: zero regret without neighbouring actionsProved
Aug 2026
Explicit coordinate-sum Bennett bound for a Bernoulli branchProved
Aug 2026
Coordinate-sum Bennett bound for a Bernoulli branch cumulantOpen
Aug 2026
Bennett bound for one branch cumulantOpen
Aug 2026
Candès–Romberg Talagrand theorem on a finite Boolean product spaceProved
Aug 2026
Two-sided Talagrand log-tail bound with unit envelopeProved
Aug 2026
Klein–Rio lower tail for a finite Bernoulli linear supremumProved
Aug 2026
Klein–Rio lower-tail cumulant bound for a finite linear supremumProved
Aug 2026
Bennett bound for one branch cumulantOpen
Aug 2026
Klein–Rio compensated-process master entropy inequalityProved
Aug 2026
Klein–Rio Proposition 2.1 on a finite Bernoulli cubeProved
Aug 2026
Poissonian upper tail for a finite Bernoulli linear supremumProved
Aug 2026
Klein–Rio Lemma 4.4: Bennett-kernel comparisonProved
Aug 2026