Worst-case large deviations upper bounds for i.i.d. sequences under ambiguity
buir.contributor.author | Pınar, Mustafa Çelebi | |
dc.citation.epage | 271 | en_US |
dc.citation.spage | 257 | en_US |
dc.citation.volumeNumber | 42 | en_US |
dc.contributor.author | Pınar, Mustafa Çelebi | en_US |
dc.date.accessioned | 2019-01-30T11:02:58Z | |
dc.date.available | 2019-01-30T11:02:58Z | |
dc.date.issued | 2018 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | An introductory study of large deviations upper bounds from a worst-case perspective under parameter uncertainty (referred to as ambiguity) of the underlying distributions is given. Borrowing ideas from robust optimization, suitable sets of ambiguity are defined for imprecise parameters of underlying distributions. Both univariate and multivariate i.i.d. sequences of random variables are considered. The resulting optimization problems are challenging min–max (or max–min) problems that admit some simplifications and some explicit results, mostly in the case of the normal probability law. | en_US |
dc.description.provenance | Submitted by Bilge Kat (bilgekat@bilkent.edu.tr) on 2019-01-30T11:02:58Z No. of bitstreams: 1 Worst-case_large_deviations_upper_bounds_for_i.i.d._sequences_under_ambiguity.pdf: 194522 bytes, checksum: 27507159a7630746ab51f8dd382c9c76 (MD5) | en |
dc.description.provenance | Made available in DSpace on 2019-01-30T11:02:58Z (GMT). No. of bitstreams: 1 Worst-case_large_deviations_upper_bounds_for_i.i.d._sequences_under_ambiguity.pdf: 194522 bytes, checksum: 27507159a7630746ab51f8dd382c9c76 (MD5) Previous issue date: 2018-01-22 | en |
dc.identifier.doi | 10.3906/mat-1607-20 | en_US |
dc.identifier.eissn | 1303-6149 | |
dc.identifier.issn | 1300-0098 | |
dc.identifier.uri | http://hdl.handle.net/11693/48519 | |
dc.language.iso | English | en_US |
dc.publisher | TÜBİTAK | en_US |
dc.relation.isversionof | https://doi.org/10.3906/mat-1607-20 | en_US |
dc.source.title | Turkish Journal of Mathematics | en_US |
dc.subject | Large deviations | en_US |
dc.subject | Ambiguity | en_US |
dc.subject | Robust optimization | en_US |
dc.subject | Ellipsoids | en_US |
dc.subject | Legendre–Fenchel transform | en_US |
dc.subject | Min–max theorem | en_US |
dc.title | Worst-case large deviations upper bounds for i.i.d. sequences under ambiguity | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Worst-case_large_deviations_upper_bounds_for_i.i.d._sequences_under_ambiguity.pdf
- Size:
- 189.96 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: