Search Results for author:
Found 5 papers, 2 papers with code
Age of Computing: A Metric of Computation Freshness in Communication and Computation Cooperative Networks
In this letter, we introduce the novel concept, Age of Computing (AoC), to capture computation freshness in 3CNs.
Adaptation to Misspecified Kernel Regularity in Kernelised Bandits
In continuum-armed bandit problems where the underlying function resides in a reproducing kernel Hilbert space (RKHS), namely, the kernelised bandit problems, an important open problem remains of how well learning algorithms can adapt if the regularity of the associated kernel function is unknown.
Integrating Rankings into Quantized Scores in Peer Review
Our approach addresses the two aforementioned challenges by: (i) ensuring that rankings are incorporated into the updates scores in the same manner for all papers, thereby mitigating arbitrariness, and (ii) allowing to seamlessly use existing interfaces and workflows designed for scores.
Smooth Bandit Optimization: Generalization to Hölder Space
We also study adaptation to unknown function smoothness over a continuous scale of H\"older spaces indexed by $\alpha$, with a bandit model selection approach applied with our proposed two-layer algorithms.
Function-on-Scalar Quantile Regression with Application to Mass Spectrometry Proteomics Data
Mass spectrometry proteomics, characterized by spiky, spatially heterogeneous functional data, can be used to identify potential cancer biomarkers.
Methodology
