PoBO: A Polynomial Bounding Method for Chance-Constrained Yield-Aware Optimization of Photonic ICs
Zichang He, Zheng Zhang

TL;DR
This paper introduces PoBO, a polynomial bounding method that improves yield-aware optimization of photonic ICs by more accurately bounding chance constraints, leading to better design performance while ensuring high yield.
Contribution
It proposes a novel polynomial kinship function for chance constraint bounding, relaxing previous assumptions and enabling global optimization in photonic IC design.
Findings
Achieves better design performance with guaranteed yield
Validates method on benchmarks showing improved results
Enables global optimization through polynomial methods
Abstract
Conventional yield optimization algorithms try to maximize the success rate of a circuit under process variations. These methods often obtain a high yield but reach a design performance that is far from the optimal value. This paper investigates an alternative yield-aware optimization for photonic ICs: we will optimize the circuit design performance while ensuring a high yield requirement. This problem was recently formulated as a chance-constrained optimization, and the chance constraint was converted to a stronger constraint with statistical moments. Such a conversion reduces the feasible set and sometimes leads to an over-conservative design. To address this fundamental challenge, this paper proposes a carefully designed polynomial function, called optimal polynomial kinship function, to bound the chance constraint more accurately. We modify existing kinship functions via relaxing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptical Network Technologies · Photonic and Optical Devices · Neural Networks and Reservoir Computing
