Face clustering using a weighted combination of deep representations

Author(s):  
Dafni Skiadopoulou ◽  
Aristidis Likas
Optimization ◽  
1976 ◽  
Vol 7 (5) ◽  
pp. 665-672
Author(s):  
H. Burke ◽  
C. Hennig ◽  
W H. Schmidt

2021 ◽  
pp. 1-34
Author(s):  
Peter A. Forsyth ◽  
Kenneth R. Vetzal ◽  
Graham Westmacott

Abstract We extend the Annually Recalculated Virtual Annuity (ARVA) spending rule for retirement savings decumulation (Waring and Siegel (2015) Financial Analysts Journal, 71(1), 91–107) to include a cap and a floor on withdrawals. With a minimum withdrawal constraint, the ARVA strategy runs the risk of depleting the investment portfolio. We determine the dynamic asset allocation strategy which maximizes a weighted combination of expected total withdrawals (EW) and expected shortfall (ES), defined as the average of the worst 5% of the outcomes of real terminal wealth. We compare the performance of our dynamic strategy to simpler alternatives which maintain constant asset allocation weights over time accompanied by either our same modified ARVA spending rule or withdrawals that are constant over time in real terms. Tests are carried out using both a parametric model of historical asset returns as well as bootstrap resampling of historical data. Consistent with previous literature that has used different measures of reward and risk than EW and ES, we find that allowing some variability in withdrawals leads to large improvements in efficiency. However, unlike the prior literature, we also demonstrate that further significant enhancements are possible through incorporating a dynamic asset allocation strategy rather than simply keeping asset allocation weights constant throughout retirement.


2012 ◽  
Vol 21 (06) ◽  
pp. 1250040
Author(s):  
NIALL ROONEY

In this paper we present a novel method that forms a weighted combination of a range of Stacking based methods for regression problems, without adding any major computational overhead in comparison to stacking itself. The intention of the technique is to benefit from the variation in performance of individual Stacking methods as demonstrated with different data sets, in order to provide a more robust technique overall. We detail an empirical analysis of the technique referred to as weighted Meta–Combiner (wMetaComb) and compare its performance to its underlying techniques.


Sign in / Sign up

Export Citation Format

Share Document