Method of developing solutions for online convex...

Details Method of developing solutions for online convex... Method of developing solutions for online convex...

2008-06-05

2010-06-01

Vincent, David R (Department: 2129)

Data processing: artificial intelligence

Machine learning

C705S014430

Reexamination Certificate

active

07730000

ABSTRACT:
Methods, systems, and computer program products are provided for the online convex optimization problem, in which the decision maker has knowledge of the all past states and resulting cost functions for his previous choices and attempts to make a new choice that results in minimum regret. The method does not rely upon the structure of the cost function or the characterization of the states and takes advantage of the similarity between successive states to enable the method to converge to a reasonably optimal result.

REFERENCES:
Zinkevich, Online Convex Programming and Generalized Infinitesimal Gradient Ascent, 2003.
Beg et al., Some Fixed Point Theorems in Convex Metric Spaces, 1991.

Affiliated with

Also associated with

Rating

Method of developing solutions for online convex... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of developing solutions for online convex..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of developing solutions for online convex... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4171905