Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sriram Krishna

dblp:276/5414 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 77% Learning theory · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › text classification
automated scoring
0.612022
Using Sampling to Estimate and Improve Performance of Automated Scoring Systems with Guarantees · AAAI 2022
Algorithms and data structures › randomized algorithms › sampling
adaptive sampling
0.612022
Using Sampling to Estimate and Improve Performance of Automated Scoring Systems with Guarantees · AAAI 2022
Algorithms and data structures › randomized algorithms
sampling
0.612022
Using Sampling to Estimate and Improve Performance of Automated Scoring Systems with Guarantees · AAAI 2022
Machine learning › Learning theory
statistical guarantees
0.212022
Using Sampling to Estimate and Improve Performance of Automated Scoring Systems with Guarantees · AAAI 2022

Methods — techniques the papers use, named apart from their topics

statistical estimation · 1.1reward sampling · 1.1importance sampling · 1.1
YearPublicationVenuePosition
2022 Using Sampling to Estimate and Improve Performance of Automated Scoring Systems with Guarantees
abstract
Automated Scoring (AS), the natural language processing task of scoring essays and speeches in an educational testing setting, is growing in popularity and being deployed across contexts from government examinations to companies providing language proficiency services. However, existing systems either forgo human raters entirely, thus harming the reliability of the test, or score every response by both human and machine thereby increasing costs. We target the spectrum of possible solutions in between, making use of both humans and machines to provide a higher quality test while keeping costs reasonable to democratize access to AS. In this work, we propose a combination of the existing paradigms, sampling responses to be scored by humans intelligently. We propose reward sampling and observe significant gains in accuracy (19.80% increase on average) and quadratic weighted kappa (QWK) (25.60% on average) with a relatively small human budget (30% samples) using our proposed sampling. The accuracy increase observed using standard random and importance sampling baselines are 8.6% and 12.2% respectively. Furthermore, we demonstrate the system's model agnostic nature by measuring its performance on a variety of models currently deployed in an AS setting as well as pseudo models. Finally, we propose an algorithm to estimate the accuracy/QWK with statistical guarantees (Our code is available at https://git.io/J1IOy).
Yaman Singla, Sriram Krishna, Rajiv Ratn Shah, Changyou Chen
AAAI2