Search Results for author:
Found 6 papers, 0 papers with code
Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise
In more detail, even for three labels and constant separation, we give a super-polynomial lower bound on the complexity of any SQ algorithm achieving optimal error.
AutoCBT: An Autonomous Multi-agent Framework for Cognitive Behavioral Therapy in Psychological Counseling
Traditional in-person psychological counseling remains primarily niche, often chosen by individuals with psychological issues, while online automated counseling offers a potential solution for those hesitant to seek help due to feelings of shame.
Active Learning of General Halfspaces: Label Queries vs Membership Queries
Specifically, to beat the passive label complexity of $\tilde{O} (d/\epsilon)$, an active learner requires a pool of $2^{poly(d)}$ unlabeled samples.
Active Learning with Simple Questions
We measure the complexity of the region queries via the VC dimension of the family of regions.
Buying Information for Stochastic Optimization
In this paper, we study how to buy information for stochastic optimization and formulate this question as an online learning problem.
Clustering with Queries under Semi-Random Noise
Our main result is a computationally efficient algorithm that can identify large clusters with $O\left(\frac{nk \log n} {(1-2p)^2}\right) + \text{poly}\left(\log n, k, \frac{1}{1-2p} \right)$ queries, matching the guarantees of the best known algorithms in the fully-random model.
