Conference paper
Automated Answer Validation using Text Similarity
Balaji Ganesan, Arjun Ravikumar, et al.
ICON 2023
In this paper, we study a general formulation of linear prediction algorithms including a number of known methods as special cases. We describe a convex duality for this class of methods and propose numerical algorithms to solve the derived dual learning problem. We show that the dual formulation is closely related to online learning algorithms. Furthermore, by using this duality, we show that new learning methods can be obtained. Numerical examples will be given to illustrate various aspects of the newly proposed algorithms.
Balaji Ganesan, Arjun Ravikumar, et al.
ICON 2023
Ira Pohl
Artificial Intelligence
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023