Generalization for slowly mixing processes
–arXiv.org Artificial Intelligence
For samples generated by stationary and φ-mixing processes we give generalization guarantees uniform over Lipschitz, smooth or unconstrained loss classes. The result depends on an empirical estimator of the distance of data drawn from the invariant distribution to the sample path. The mixing time (the time needed to obtain approximate independence) enters these results explicitely only in an additive way. For slowly mixing processes this can be a considerable advantage over results with multiplicative dependence on the mixing time. Because of the applicability to unconstrained loss classes, where the bound depends only on local Lipschitz properties at the sample points, it may be interesting also for iid processes, whenever the data distribution is a sufficiently simple object.
arXiv.org Artificial Intelligence
Jun-1-2023
- Country:
- Asia > Middle East
- Jordan (0.04)
- Europe > Italy
- North America > United States
- Florida > Palm Beach County > Boca Raton (0.04)
- Asia > Middle East
- Genre:
- Research Report (0.50)
- Technology: