Robust Granular Optimization: A Structured Approach for Optimization Under Integrated Uncertainty
Bibliographic record
Abstract
Solving optimization problems under hybrid uncertainty bears a heavy computational burden. In this study, we propose a unified structured optimization approach, termed robust granular optimization (RGO), to tackle the optimization problems under hybrid manifold uncertainties in a computationally tractable manner. Essentially, the RGO can be regarded as a complementary fusion of granular computing and robust optimization techniques. The paradigm of RGO consists of three core phases: 1) uncertainty identification, 2) information granulation in which basic granular units (BGUs) are formed, and 3) robust optimization realized over the BGUs. Following the proposed paradigm, we develop two classes of RGO models for general single-stage and two-stage optimization problems with separable and higher order hybrid uncertainties, respectively. It is shown that both types RGO models can be equivalently transformed into linear programs or mixed integer linear programs that can be handled efficiently by off-the-shelf solvers. Furthermore, a target-based tradeoff model is developed to enhance the flexibility of the RGO models in balancing the granularity level (or robustness level) and the solution conservativeness. The tradeoff model can also be efficiently solved by a binary search algorithm. Finally, sufficient computational studies are presented, and comparisons with the existing approaches show that the RGO models can bring much higher computational efficiency and scalability without losing much optimality, and the RGO solutions exhibit a stronger resistance to the uncertainty.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".