Search results for "Machine learning"
showing 10 items of 1464 documents
Unbiased Branches: An Open Problem
2007
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches, which are difficult-to-predict. In this paper, we evaluate the impact of unbiased branches in terms of prediction accuracy on a range of branch difference predictors using prediction by partial matching, multiple Markov prediction and neural-based prediction. Since our focus is on the impact that unbiased branches have on processor performance, timing issues and hardware costs are out of scope of this investigation. Our simulation results, with the SPEC2000 in…
Online Metric Learning Methods Using Soft Margins and Least Squares Formulations
2012
Online metric learning using margin maximization has been introduced as a way to learn appropriate dissimilarity measures in an efficient way when information as pairs of examples is given to the learning system in a progressive way. These schemes have several practical advantages with regard to global ones in which a training set needs to be processed. On the other hand, they may suffer from a poor performance depending on the quality of the examples and the particular tuning or other implementation details. This paper formulates several online metric learning alternatives using a passive-aggressive schema. A new formulation of the online problem using least squares is also introduced. The…
Improvement of Statistical Decisions under Parametric Uncertainty
2011
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncertainty. Decision‐making under uncertainty is a central problem in statistical inference, and has been formally studied in virtually all approaches to inference. The aim of the present paper is to show how the invariant embedding technique, the idea of which belongs to the authors, may be employed in the particular case of finding the improved statistical decisions under parametric uncertainty. This technique represents a simple and computationally attractive statistical method based on the constructive use of the i…
Fitness diversity based adaptation in Multimeme Algorithms:A comparative study
2007
This paper compares three different fitness diversity adaptations in multimeme algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely fast adaptive memetic algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a proper adaptation must be made by considering features of the problem under study. More specifically, one of these adaptations outperforms the others in the presence of plateaus or limited range of variability in fitness values, another adaptation is more proper for landscapes having distant and strong basins of attraction, the third one, …
An Introduction to Kernel Methods
2009
Machine learning has experienced a great advance in the eighties and nineties due to the active research in artificial neural networks and adaptive systems. These tools have demonstrated good results in many real applications, since neither a priori knowledge about the distribution of the available data nor the relationships among the independent variables should be necessarily assumed. Overfitting due to reduced training data sets is controlled by means of a regularized functional which minimizes the complexity of the machine. Working with high dimensional input spaces is no longer a problem thanks to the use of kernel methods. Such methods also provide us with new ways to interpret the cl…
Resource-constrained project scheduling: A critical activity reordering heuristic
2003
Abstract In this paper, we present a new metaheuristic algorithm for the resource-constrained project-scheduling problem. The procedure is a non-standard implementation of fundamental concepts of tabu search without explicitly using memory structures embedded in a population-based framework. The procedure makes use of a fan search strategy to intensify the search, whereas a strategic oscillation mechanism loosely related to the forward/backward technique provides the necessary diversification. Our implementation employs the topological order (TO) representation of schedules. To explore the TO vector space we introduce three types of moves, two of them based on the concept of relative critic…
Obtaining the best value for money in adaptive sequential estimation
2010
Abstract In [Kujala, J. V., Richardson, U., & Lyytinen, H. (2010). A Bayesian-optimal principle for learner-friendly adaptation in learning games. Journal of Mathematical Psychology , 54(2), 247–255], we considered an extension of the conventional Bayesian adaptive estimation framework to situations where each observable variable is associated with a certain random cost of observation. We proposed an algorithm that chooses each placement by maximizing the expected gain in utility divided by the expected cost. In this paper, we formally justify this placement rule as an asymptotically optimal solution to the problem of maximizing the expected utility of an experiment that terminates when the…
Conformal equivalence of visual metrics in pseudoconvex domains
2017
We refine estimates introduced by Balogh and Bonk, to show that the boundary extensions of isometries between smooth strongly pseudoconvex domains in $\C^n$ are conformal with respect to the sub-Riemannian metric induced by the Levi form. As a corollary we obtain an alternative proof of a result of Fefferman on smooth extensions of biholomorphic mappings between pseudoconvex domains. The proofs are inspired by Mostow's proof of his rigidity theorem and are based on the asymptotic hyperbolic character of the Kobayashi or Bergman metrics and on the Bonk-Schramm hyperbolic fillings.
Algebras of frequently hypercyclic vectors
2019
We show that the multiples of the backward shift operator on the spaces $\ell_{p}$, $1\leq p<\infty$, or $c_{0}$, when endowed with coordinatewise multiplication, do not possess frequently hypercyclic algebras. More generally, we characterize the existence of algebras of $\mathcal{A}$-hypercyclic vectors for these operators. We also show that the differentiation operator on the space of entire functions, when endowed with the Hadamard product, does not possess frequently hypercyclic algebras. On the other hand, we show that for any frequently hypercyclic operator $T$ on any Banach space, $FHC(T)$ is algebrable for a suitable product, and in some cases it is even strongly algebrable.
Predicting sediment deposition rate in check-dams using machine learning techniques and high-resolution DEMs
2021
Sediments accumulated in check dams are a valuable measure to estimate soil erosion rates. Here, geographic information systems (GIS) and three machine learning techniques (MARS-multivariate adaptive regression splines, RF-random forest and SVM-support vector machine) were used, for the first time, to predict sediment deposition rate (SR) in check-dams located in six watersheds in SW Spain. There, 160 dry-stone check dams (~ 77.8 check-dams km−2), accumulated sediments during a period that varied from 11 to 23 years. The SR was estimated in former research using a topographical method and a high-resolution Digital Elevation Model (DEM) (average of 0.14 m3 ha−1 year−1). Nine environmental-to…