Search results for "Algorithm"

showing 10 items of 4887 documents

Accounting for Input Noise in Gaussian Process Parameter Retrieval

2020

Gaussian processes (GPs) are a class of Kernel methods that have shown to be very useful in geoscience and remote sensing applications for parameter retrieval, model inversion, and emulation. They are widely used because they are simple, flexible, and provide accurate estimates. GPs are based on a Bayesian statistical framework which provides a posterior probability function for each estimation. Therefore, besides the usual prediction (given in this case by the mean function), GPs come equipped with the possibility to obtain a predictive variance (i.e., error bars, confidence intervals) for each prediction. Unfortunately, the GP formulation usually assumes that there is no noise in the inpu…

FOS: Computer and information sciencesComputer Science - Machine LearningComputer sciencePosterior probability0211 other engineering and technologiesMachine Learning (stat.ML)02 engineering and technologyMachine Learning (cs.LG)symbols.namesakeStatistics - Machine LearningElectrical and Electronic EngineeringGaussian process021101 geological & geomatics engineeringPropagation of uncertaintyNoise measurementbusiness.industryFunction (mathematics)Geotechnical Engineering and Engineering GeologySea surface temperatureNoiseKernel methodsymbolsGlobal Positioning SystemErrors-in-variables modelsbusinessAlgorithmIEEE Geoscience and Remote Sensing Letters
researchProduct

Group Importance Sampling for particle filtering and MCMC

2018

Bayesian methods and their implementations by means of sophisticated Monte Carlo techniques have become very popular in signal processing over the last years. Importance Sampling (IS) is a well-known Monte Carlo technique that approximates integrals involving a posterior distribution by means of weighted samples. In this work, we study the assignation of a single weighted sample which compresses the information contained in a population of weighted samples. Part of the theory that we present as Group Importance Sampling (GIS) has been employed implicitly in different works in the literature. The provided analysis yields several theoretical and practical consequences. For instance, we discus…

FOS: Computer and information sciencesComputer Science - Machine LearningComputer sciencePosterior probabilityMonte Carlo methodMachine Learning (stat.ML)02 engineering and technologyMultiple-try MetropolisStatistics - Computation01 natural sciencesMachine Learning (cs.LG)Computational Engineering Finance and Science (cs.CE)Methodology (stat.ME)010104 statistics & probabilitysymbols.namesake[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingStatistics - Machine LearningArtificial IntelligenceResampling0202 electrical engineering electronic engineering information engineering0101 mathematicsElectrical and Electronic EngineeringComputer Science - Computational Engineering Finance and ScienceStatistics - MethodologyComputation (stat.CO)ComputingMilieux_MISCELLANEOUSMarkov chainApplied Mathematics020206 networking & telecommunicationsMarkov chain Monte CarloStatistics::ComputationComputational Theory and MathematicsSignal ProcessingsymbolsComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyParticle filter[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingAlgorithmImportance samplingDigital Signal Processing
researchProduct

Using the Tsetlin Machine to Learn Human-Interpretable Rules for High-Accuracy Text Categorization With Medical Applications

2019

Medical applications challenge today's text categorization techniques by demanding both high accuracy and ease-of-interpretation. Although deep learning has provided a leap ahead in accuracy, this leap comes at the sacrifice of interpretability. To address this accuracy-interpretability challenge, we here introduce, for the first time, a text categorization approach that leverages the recently introduced Tsetlin Machine. In all brevity, we represent the terms of a text as propositional variables. From these, we capture categories using simple propositional formulae, such as: if "rash" and "reaction" and "penicillin" then Allergy. The Tsetlin Machine learns these formulae from a labelled tex…

FOS: Computer and information sciencesComputer Science - Machine LearningGeneral Computer ScienceComputer sciencetext categorizationNatural language understandingDecision treeMachine Learning (stat.ML)02 engineering and technologyVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550::Annen informasjonsteknologi: 559Machine learningcomputer.software_genresupervised learningMachine Learning (cs.LG)Naive Bayes classifierText miningStatistics - Machine Learning0202 electrical engineering electronic engineering information engineeringGeneral Materials ScienceTsetlin machinehealth informaticsInterpretabilityPropositional variableClassification algorithmsArtificial neural networkbusiness.industryDeep learning020208 electrical & electronic engineeringGeneral EngineeringRandom forestSupport vector machinemachine learningCategorization020201 artificial intelligence & image processingArtificial intelligencelcsh:Electrical engineering. Electronics. Nuclear engineeringbusinessPrecision and recallcomputerlcsh:TK1-9971
researchProduct

Deep Importance Sampling based on Regression for Model Inversion and Emulation

2021

Understanding systems by forward and inverse modeling is a recurrent topic of research in many domains of science and engineering. In this context, Monte Carlo methods have been widely used as powerful tools for numerical inference and optimization. They require the choice of a suitable proposal density that is crucial for their performance. For this reason, several adaptive importance sampling (AIS) schemes have been proposed in the literature. We here present an AIS framework called Regression-based Adaptive Deep Importance Sampling (RADIS). In RADIS, the key idea is the adaptive construction via regression of a non-parametric proposal density (i.e., an emulator), which mimics the posteri…

FOS: Computer and information sciencesComputer Science - Machine LearningImportance samplingComputer scienceMonte Carlo methodPosterior probabilityBayesian inferenceInferenceContext (language use)Machine Learning (stat.ML)02 engineering and technologyEstadísticaStatistics - ComputationMachine Learning (cs.LG)symbols.namesakeSurrogate modelStatistics - Machine LearningArtificial Intelligence0202 electrical engineering electronic engineering information engineeringAdaptive regressionEmulationElectrical and Electronic EngineeringModel inversionGaussian processComputation (stat.CO)EmulationApplied Mathematics020206 networking & telecommunicationsRemote sensingComputational Theory and MathematicsSignal Processingsymbols020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyAlgorithmImportance sampling
researchProduct

Ockham's Razor in Memetic Computing: Three Stage Optimal Memetic Exploration

2012

Memetic computing is a subject in computer science which considers complex structures as the combination of simple agents, memes, whose evolutionary interactions lead to intelligent structures capable of problem-solving. This paper focuses on memetic computing optimization algorithms and proposes a counter-tendency approach for algorithmic design. Research in the field tends to go in the direction of improving existing algorithms by combining different methods or through the formulation of more complicated structures. Contrary to this trend, we instead focus on simplicity, proposing a structurally simple algorithm with emphasis on processing only one solution at a time. The proposed algorit…

FOS: Computer and information sciencesComputer Science - Machine LearningInformation Systems and ManagementComputer scienceComputer Science - Artificial Intelligencemedia_common.quotation_subjectEvolutionary algorithmComputational intelligenceField (computer science)Theoretical Computer ScienceMachine Learning (cs.LG)Artificial IntelligenceSimplicitymemetic algorithmsevolutionary algorithmsmedia_common:Engineering::Computer science and engineering [DRNTU]business.industrycomputational intelligence optimizationComputer Science ApplicationsArtificial Intelligence (cs.AI)Control and Systems Engineeringmemetic computing:Engineering::Electrical and electronic engineering [DRNTU]Memetic algorithmAlgorithm designArtificial intelligencebusinessSoftware
researchProduct

Learning from Data to Speed-up Sorted Table Search Procedures: Methodology and Practical Guidelines

2020

Sorted Table Search Procedures are the quintessential query-answering tool, with widespread usage that now includes also Web Applications, e.g, Search Engines (Google Chrome) and ad Bidding Systems (AppNexus). Speeding them up, at very little cost in space, is still a quite significant achievement. Here we study to what extend Machine Learning Techniques can contribute to obtain such a speed-up via a systematic experimental comparison of known efficient implementations of Sorted Table Search procedures, with different Data Layouts, and their Learned counterparts developed here. We characterize the scenarios in which those latter can be profitably used with respect to the former, accounting …

FOS: Computer and information sciencesComputer Science - Machine LearningStatistics - Machine LearningComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Machine Learning (stat.ML)E.1; I.2.068T07 68P05 62J05 68P10E.1I.2.0Machine Learning (cs.LG)
researchProduct

Kernel methods and their derivatives: Concept and perspectives for the earth system sciences.

2020

Kernel methods are powerful machine learning techniques which implement generic non-linear functions to solve complex tasks in a simple way. They Have a solid mathematical background and exhibit excellent performance in practice. However, kernel machines are still considered black-box models as the feature mapping is not directly accessible and difficult to interpret.The aim of this work is to show that it is indeed possible to interpret the functions learned by various kernel methods is intuitive despite their complexity. Specifically, we show that derivatives of these functions have a simple mathematical formulation, are easy to compute, and can be applied to many different problems. We n…

FOS: Computer and information sciencesComputer Science - Machine LearningSupport Vector MachineTheoretical computer scienceComputer scienceEntropyKernel FunctionsNormal Distribution0211 other engineering and technologies02 engineering and technologyMachine Learning (cs.LG)Machine LearningStatistics - Machine LearningSimple (abstract algebra)0202 electrical engineering electronic engineering information engineeringOperator TheoryData ManagementMultidisciplinaryGeographyApplied MathematicsSimulation and ModelingQRDensity estimationKernel methodKernel (statistics)Physical SciencessymbolsMedicine020201 artificial intelligence & image processingAlgorithmsResearch ArticleComputer and Information SciencesScienceMachine Learning (stat.ML)Research and Analysis MethodsKernel MethodsKernel (linear algebra)symbols.namesakeArtificial IntelligenceSupport Vector MachinesHumansEntropy (information theory)Computer SimulationGaussian process021101 geological & geomatics engineeringData VisualizationCorrectionRandom VariablesFunction (mathematics)Probability TheorySupport vector machineAlgebraPhysical GeographyLinear AlgebraEarth SciencesEigenvectorsRandom variableMathematicsEarth SystemsPLoS ONE
researchProduct

Visibly pushdown modular games,

2014

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automat…

FOS: Computer and information sciencesComputer Science::Computer Science and Game TheoryComputer Science - Logic in Computer ScienceTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFormal Languages and Automata Theory (cs.FL)Computer scienceComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)Pushdown01 natural scienceslcsh:QA75.5-76.95Theoretical Computer ScienceComputer Science - Computer Science and Game TheoryComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineeringTemporal logicRecursionbusiness.industrylcsh:MathematicsGames; Modular; Pushdown; Theoretical Computer Science; Information Systems; Computer Science Applications; Computational Theory and MathematicsPushdown automatonModular designDecision problemlcsh:QA1-939Logic in Computer Science (cs.LO)Computer Science ApplicationsUndecidable problemDecidabilityNondeterministic algorithmComputer Science - Computational ComplexityModularTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceGamesbusinessComputer Science::Formal Languages and Automata TheoryComputer Science and Game Theory (cs.GT)Information SystemsInformation and Computation
researchProduct

On the Complexity of Solving Subtraction Games

2018

We study algorithms for solving Subtraction games, which sometimes are referred to as one-heap Nim games. We describe a quantum algorithm which is applicable to any game on DAG, and show that its query compexity for solving an arbitrary Subtraction game of $n$ stones is $O(n^{3/2}\log n)$. The best known deterministic algorithms for solving such games are based on the dynamic programming approach. We show that this approach is asymptotically optimal and that classical query complexity for solving a Subtraction game is generally $\Theta(n^2)$. This paper perhaps is the first explicit "quantum" contribution to algorithmic game theory.

FOS: Computer and information sciencesComputer Science::Computer Science and Game TheoryQuantum PhysicsComputer Science - Computational ComplexityComputer Science - Computer Science and Game TheoryComputer Science - Data Structures and AlgorithmsComputingMilieux_PERSONALCOMPUTINGFOS: Physical sciencesData Structures and Algorithms (cs.DS)Computational Complexity (cs.CC)Quantum Physics (quant-ph)Computer Science and Game Theory (cs.GT)
researchProduct

Probabilistic and team PFIN-type learning: General properties

2008

We consider the probability hierarchy for Popperian FINite learning and study the general properties of this hierarchy. We prove that the probability hierarchy is decidable, i.e. there exists an algorithm that receives p_1 and p_2 and answers whether PFIN-type learning with the probability of success p_1 is equivalent to PFIN-type learning with the probability of success p_2. To prove our result, we analyze the topological structure of the probability hierarchy. We prove that it is well-ordered in descending ordering and order-equivalent to ordinal epsilon_0. This shows that the structure of the hierarchy is very complicated. Using similar methods, we also prove that, for PFIN-type learning…

FOS: Computer and information sciencesComputer Science::Machine LearningTheoretical computer scienceComputer Networks and CommunicationsExistential quantificationStructure (category theory)DecidabilityType (model theory)Learning in the limitTheoretical Computer ScienceMachine Learning (cs.LG)Probability of successFinite limitsMathematicsOrdinalsDiscrete mathematicsHierarchybusiness.industryApplied MathematicsAlgorithmic learning theoryProbabilistic logicF.1.1 I.2.6Inductive inferenceInductive reasoningDecidabilityComputer Science - LearningTeam learningComputational Theory and MathematicsArtificial intelligencebusinessJournal of Computer and System Sciences
researchProduct