paper-with-me

Papers

How to Solve Big Problems: Bespoke Versus Platform Strategies

2022-06-09 · Atif Ansar, Bent Flyvbjerg

How should government and business solve big problems? In bold leaps or in many smaller moves? We show that bespoke, one-off projects are prone to poorer outcomes than projects built on a repeatable platform. Repeatable projects are cheaper, faster, and scale at lower risk of failure. We compare evidence from 203 space missions at NASA and SpaceX, on cost, speed-to-market, schedule, and scalability. We find that SpaceX's platform strategy was 10X cheaper and 2X faster than NASA's bespoke strategy. Moreover, SpaceX's platform strategy was financially less risky, virtually eliminating cost overruns. Finally, we show that achieving platform repeatability is a strategically diligent process involving experimental learning sequences. Sectors of the economy where governments find it difficult to control spending or timeframes or to realize planned benefits - e.g., health, education, climate, defence - are ripe for a platform rethink.

📄 PDF Abstract BibTeX arXiv:2206.08754

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Bespoke Solvers for Generative Flow Models

2023-10-29 · Neta Shaul, Juan Perez, Ricky T. Q. Chen, Ali Thabet 외

Diffusion or flow-based models are powerful generative paradigms that are notoriously hard to sample as samples are defined as solutions to high-dimensional Ordinary or Stochastic Differential Equations (ODEs/SDEs) which…

GPU

Generalized Mean Absolute Directional Loss as a Solution to Overfitting and High Transaction Costs in Machine Learning Models Used in High-Frequency Algorithmic Investment Strategies

2024-12-24 · Jakub Michańków, Paweł Sakowski, Robert Ślepaczuk

Regardless of the selected asset class and the level of model complexity (Transformer versus LSTM versus Perceptron/RNN), the GMADL loss function produces superior results than standard MSE-type loss functions and has be…

Algorithmic Trading

Generating Local Search Neighborhood with Synthesized Logic Programs

2019-09-18 · Mateusz Ślażyński, Salvador Abreu, Grzegorz J. Nalepa

Local Search meta-heuristics have been proven a viable approach to solve difficult optimization problems. Their performance depends strongly on the search space landscape, as defined by a cost function and the selected n…

Traveling Salesman Problem

Bespoke Non-Stationary Solvers for Fast Sampling of Diffusion and Flow Models

2024-03-02 · Neta Shaul, Uriel Singer, Ricky T. Q. Chen, Matthew Le 외

This paper introduces Bespoke Non-Stationary (BNS) Solvers, a solver distillation approach to improve sample efficiency of Diffusion and Flow models. BNS solvers are based on a family of non-stationary solvers that prova…

Audio GenerationConditional Image GenerationDiversityImage Generation+2

Fairness Through Counterfactual Utilities

2021-08-11 · Jack Blandin, Ian Kash

Group fairness definitions such as Demographic Parity and Equal Opportunity make assumptions about the underlying decision-problem that restrict them to classification problems. Prior work has translated these definition…

BIG-bench Machine LearningcounterfactualFairnessreinforcement-learning+2