Arrow Research search

Author name cluster

Ralph Neuneier

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

8 papers
1 author row

Possible papers

8

NeurIPS Conference 2001 Conference Paper

Active Portfolio-Management based on Error Correction Neural Networks

  • Hans-Georg Zimmermann
  • Ralph Neuneier
  • Ralph Grothmann

This paper deals with a neural network architecture which establishes a portfolio management system similar to the Black / Litterman approach. This allocation scheme distributes funds across various securities or fi- nancial markets while simultaneously complying with specific allocation constraints which meet the requirements of an investor. The portfolio optimization algorithm is modeled by a feedforward neural network. The underlying expected return forecasts are based on error correction neural networks (ECNN), which utilize the last model error as an auxiliary input to evaluate their own misspecification. The portfolio optimization is implemented such that (i. ) the allocations comply with investor’s constraints and that (ii. ) the risk of the portfo- lio can be controlled. We demonstrate the profitability of our approach by constructing internationally diversified portfolios across  different financial markets of the G7 contries. It turns out, that our approach is superior to a preset benchmark portfolio. 1 Introduction: Portfolio-Management We integrate the portfolio optimization algorithm suggested by Black / Litterman [1] into a neural network architecture. Combining the mean-variance theory [5] with the capital asset pricing model (CAPM) [7], this approach utilizes excess returns of the CAPM equilibrium to define a neutral, well balanced benchmark portfolio. Deviations from the benchmark allocation are only allowed within preset boundaries. Hence, as an advantage, there are no unrealistic solutions (e. g. large short positions, huge portfolio changes). Moreover, there is no need of formulating return expectations for all assets. In contrast to Black / Litterman, excess return forecasts are estimated by time-delay recur- rent error correction neural networks [8]. Investment decisions which comply with given allocation constraints are derived from these predictions. The risk exposure of the portfolio is implicitly controlled by a parameter-optimizing task over time (sec. 3 and 5). Our approach consists of the following three steps: (i. ) Construction of forecast models    on the basis of error correction neural networks (ECNN) for all  assets (sec. 2).  To whom correspondence should be addressed: Georg. Zimmermann@mchp. siemens. de. (sec. 3 and 4). By this, the profitability of an asset with respect to all others is measured. (ii. ) Computation of excess returns  (iii. ) Optimization of the investment proportions Allocation constraints ensure, that the investment proportions  by a higher-level feedforward network  on the basis of the excess returns.  may deviate from a given benchmark only within predefined intervals (sec. 3 and 4). Finally, we apply our neural network based portfolio management system to an asset allo- cation problem concerning the G7 countries (sec. 6).  2 Forecasting by Error Correction Neural Networks Most dynamical systems are driven by a superposition of autonomous development and external influences [8]. For discrete time grids, such a dynamics can be described by a recurrent state transition   and an output equation (Eq. 1).   state transition eq. output eq.

NeurIPS Conference 1998 Conference Paper

Risk Sensitive Reinforcement Learning

  • Ralph Neuneier
  • Oliver Mihatsch

A directed generative model for binary data using a small number of hidden continuous units is investigated. A clipping nonlinear(cid: 173) ity distinguishes the model from conventional principal components analysis. The relationships between the correlations of the underly(cid: 173) ing continuous Gaussian variables and the binary output variables are utilized to learn the appropriate weights of the network. The advantages of this approach are illustrated on a translationally in(cid: 173) variant binary distribution and on handwritten digit images.

NeurIPS Conference 1997 Conference Paper

Enhancing Q-Learning for Optimal Asset Allocation

  • Ralph Neuneier

This paper enhances the Q-Iearning algorithm for optimal asset alloca(cid: 173) tion proposed in (Neuneier, 1996 [6]). The new formulation simplifies the approach by using only one value-function for many assets and al(cid: 173) lows model-free policy-iteration. After testing the new algorithm on real data, the possibility of risk management within the framework of Markov decision problems is analyzed. The proposed methods allows the construction of a multi-period portfolio management system which takes into account transaction costs, the risk preferences of the investor, and several constraints on the allocation.

NeurIPS Conference 1997 Conference Paper

The Observer-Observation Dilemma in Neuro-Forecasting

  • Hans-Georg Zimmermann
  • Ralph Neuneier

We explain how the training data can be separated into clean informa(cid: 173) tion and unexplainable noise. Analogous to the data, the neural network is separated into a time invariant structure used for forecasting, and a noisy part. We propose a unified theory connecting the optimization al(cid: 173) gorithms for cleaning and learning together with algorithms that control the data noise and the parameter noise. The combined algorithm allows a data-driven local control of the liability of the network parameters and therefore an improvement in generalization. The approach is proven to be very useful at the task of forecasting the German bond market. 1 Introduction: The Observer-Observation Dilemma Human beings believe that they are able to solve a psychological version of the Observer(cid: 173) Observation Dilemma. On the one hand, they use their observations to constitute an under(cid: 173) standing of the laws of the world, on the other hand, they use this understanding to evaluate the correctness of the incoming pieces of information. Of course, as everybody knows, human beings are not free from making mistakes in this psychological dilemma. We en(cid: 173) counter a similar situation when we try to build a mathematical model using data. Learning relationships from the data is only one part of the model building process. Overrating this part often leads to the phenomenon of overfitting in many applications (especially in eco(cid: 173) nomic forecasting). In practice, evaluation of the data is often done by external knowledge, i. e. by optimizing the model under constraints of smoothness and regularization [7]. If we assume, that our model summerizes the best knowledge of the system to be identified, why should we not use the model itself to evaluate the correctness of the data? One approach to do this is called Clearning [11]. In this paper, we present a unified approach of the interac(cid: 173) tion between the data and a neural network (see also [8]). It includes a new symmetric view on the optimization algorithms, here learning and cleaning, and their control by parameter and data noise. The Observer-Observation Dilemma in Neuro-Forecasting 993

NeurIPS Conference 1996 Conference Paper

Early Brain Damage

  • Volker Tresp
  • Ralph Neuneier
  • Hans-Georg Zimmermann

Optimal Brain Damage (OBD) is a method for reducing the num(cid: 173) ber of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid approximation if the learning algorithm has converged into a local minimum. On the other hand it is often desirable to terminate the learning pro(cid: 173) cess before a local minimum is reached (early stopping). In this paper we show that OBD estimates the increase in cost function incorrectly if the network is not in a local minimum. We also show how OBD can be extended such that it can be used in connec(cid: 173) tion with early stopping. We call this new approach Early Brain Damage, EBD. EBD also allows to revive already pruned weights. We demonstrate the improvements achieved by EBD using three publicly available data sets.

NeurIPS Conference 1995 Conference Paper

Optimal Asset Allocation using Adaptive Dynamic Programming

  • Ralph Neuneier

In recent years, the interest of investors has shifted to computer(cid: 173) ized asset allocation (portfolio management) to exploit the growing dynamics of the capital markets. In this paper, asset allocation is formalized as a Markovian Decision Problem which can be opti(cid: 173) mized by applying dynamic programming or reinforcement learning based algorithms. Using an artificial exchange rate, the asset allo(cid: 173) cation strategy optimized with reinforcement learning (Q-Learning) is shown to be equivalent to a policy computed by dynamic pro(cid: 173) gramming. The approach is then tested on the task to invest liquid capital in the German stock market. Here, neural networks are used as value function approximators. The resulting asset alloca(cid: 173) tion strategy is superior to a heuristic benchmark policy. This is a further example which demonstrates the applicability of neural network based reinforcement learning to a problem setting with a high dimensional state space.

NeurIPS Conference 1994 Conference Paper

Efficient Methods for Dealing with Missing Data in Supervised Learning

  • Volker Tresp
  • Ralph Neuneier
  • Subutai Ahmad

We present efficient algorithms for dealing with the problem of mis(cid: 173) sing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation of the input data dis(cid: 173) tribution using Parzen windows. For recall, we obtain closed form solutions for arbitrary feedforward networks. For training, we show how the backpropagation step for an incomplete pattern can be approximated by a weighted averaged backpropagation step. The complexity of the solutions for training and recall is independent of the number of missing features. We verify our theoretical results using one classification and one regression problem.

NeurIPS Conference 1993 Conference Paper

Training Neural Networks with Deficient Data

  • Volker Tresp
  • Subutai Ahmad
  • Ralph Neuneier

We analyze how data with uncertain or missing input features can be incorporated into the training of a neural network. The gen(cid: 173) eral solution requires a weighted integration over the unknown or uncertain input although computationally cheaper closed-form so(cid: 173) lutions can be found for certain Gaussian Basis Function (GBF) networks. We also discuss cases in which heuristical solutions such as substituting the mean of an unknown input can be harmful.

v2026.09.13