text stringlengths 0 4.09k |
|---|
Title: Graph polynomials and approximation of partition functions with Loopy Belief Propagation |
Abstract: The Bethe approximation, or loopy belief propagation algorithm is a successful method for approximating partition functions of probabilistic models associated with a graph. Chertkov and Chernyak derived an interesting formula called Loop Series Expansion, which is an expansion of the partition function. The m... |
Title: Computer- and robot-assisted Medical Intervention |
Abstract: Medical robotics includes assistive devices used by the physician in order to make his/her diagnostic or therapeutic practices easier and more efficient. This chapter focuses on such systems. It introduces the general field of Computer-Assisted Medical Interventions, its aims, its different components and des... |
Title: On the Goodness-of-Fit Testing for Ergodic Diffusion Processes |
Abstract: We consider the goodness of fit testing problem for ergodic diffusion processes. The basic hypothesis is supposed to be simple. The diffusion coefficient is known and the alternatives are described by the different trend coefficients. We study the asymptotic distribution of the Cramer-von Mises type tests bas... |
Title: Goodness-of-Fit Tests for Perturbed Dynamical Systems |
Abstract: We consider the goodness of fit testing problem for stochastic differential equation with small diffiusion coefficient. The basic hypothesis is always simple and it is described by the known trend coefficient. We propose several tests of the type of Cramer-von Mises, Kolmogorov-Smirnov and Chi-Square. The pow... |
Title: Adaptive pointwise estimation in time-inhomogeneous conditional heteroscedasticity models |
Abstract: This paper offers a new method for estimation and forecasting of the volatility of financial time series when the stationarity assumption is violated. Our general local parametric approach particularly applies to general varying-coefficient parametric models, such as GARCH, whose coefficients may arbitrarily ... |
Title: Multidimensional Online Robot Motion |
Abstract: We consider three related problems of robot movement in arbitrary dimensions: coverage, search, and navigation. For each problem, a spherical robot is asked to accomplish a motion-related task in an unknown environment whose geometry is learned by the robot during navigation. The robot is assumed to have tact... |
Title: An Exponential Lower Bound on the Complexity of Regularization Paths |
Abstract: For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter, as for example the Support Vector Machine (SVM). Solution path algorith... |
Title: A Combinatorial Algorithm to Compute Regularization Paths |
Abstract: For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal para... |
Title: Learning Multiple Belief Propagation Fixed Points for Real Time Inference |
Abstract: In the context of inference with expectation constraints, we propose an approach based on the "loopy belief propagation" algorithm LBP, as a surrogate to an exact Markov Random Field MRF modelling. A prior information composed of correlations among a large set of N variables, is encoded into a graphical model... |
Title: Time manipulation technique for speeding up reinforcement learning in simulations |
Abstract: A technique for speeding up reinforcement learning algorithms by using time manipulation is proposed. It is applicable to failure-avoidance control problems running in a computer simulation. Turning the time of the simulation backwards on failure events is shown to speed up the learning by 260% and improve th... |
Title: Digital Restoration of Ancient Papyri |
Abstract: Image processing can be used for digital restoration of ancient papyri, that is, for a restoration performed on their digital images. The digital manipulation allows reducing the background signals and enhancing the readability of texts. In the case of very old and damaged documents, this is fundamental for i... |
Title: Flow of Activity in the Ouroboros Model |
Abstract: The Ouroboros Model is a new conceptual proposal for an algorithmic structure for efficient data processing in living beings as well as for artificial agents. Its central feature is a general repetitive loop where one iteration cycle sets the stage for the next. Sensory input activates data structures (schema... |
Title: Modified-CS: Modifying Compressive Sensing for Problems with Partially Known Support |
Abstract: We study the problem of reconstructing a sparse signal from a limited number of its linear projections when a part of its support is known, although the known part may contain some errors. The ``known" part of the support, denoted T, may be available from prior knowledge. Alternatively, in a problem of recurs... |
Title: Mathematical Model for Transformation of Sentences from Active Voice to Passive Voice |
Abstract: Formal work in linguistics has both produced and used important mathematical tools. Motivated by a survey of models for context and word meaning, syntactic categories, phrase structure rules and trees, an attempt is being made in the present paper to present a mathematical model for structuring of sentences f... |
Title: Quantum decision theory as quantum theory of measurement |
Abstract: We present a general theory of quantum information processing devices, that can be applied to human decision makers, to atomic multimode registers, or to molecular high-spin registers. Our quantum decision theory is a generalization of the quantum theory of measurement, endowed with an action ring, a prospect... |
Title: Sure independence screening in generalized linear models with NP-dimensionality |
Abstract: Ultrahigh-dimensional variable selection plays an increasingly important role in contemporary scientific discoveries and statistical research. Among others, Fan and Lv [J. R. Stat. Soc. Ser. B Stat. Methodol. 70 (2008) 849-911] propose an independent screening framework by ranking the marginal correlations. T... |
Title: Equitable Partitioning Policies for Mobile Robotic Networks |
Abstract: The most widely applied strategy for workload sharing is to equalize the workload assigned to each resource. In mobile multi-agent systems, this principle directly leads to equitable partitioning policies in which (i) the workspace is divided into subregions of equal measure, (ii) there is a bijective corresp... |
Title: Heterogeneous knowledge representation using a finite automaton and first order logic: a case study in electromyography |
Abstract: In a certain number of situations, human cognitive functioning is difficult to represent with classical artificial intelligence structures. Such a difficulty arises in the polyneuropathy diagnosis which is based on the spatial distribution, along the nerve fibres, of lesions, together with the synthesis of se... |
Title: A Mixture-Based Approach to Regional Adaptation for MCMC |
Abstract: Recent advances in adaptive Markov chain Monte Carlo (AMCMC) include the need for regional adaptation in situations when the optimal transition kernel is different across different regions of the sample space. Motivated by these findings, we propose a mixture-based approach to determine the partition needed f... |
Title: A Stochastic View of Optimal Regret through Minimax Duality |
Abstract: We study the regret of optimal strategies for online convex optimization games. Using von Neumann's minimax theorem, we show that the optimal regret in this adversarial setting is closely related to the behavior of the empirical minimization algorithm in a stochastic process setting: it is equal to the maximu... |
Title: Exact Non-Parametric Bayesian Inference on Infinite Trees |
Abstract: Given i.i.d. data from an unknown distribution, we consider the problem of predicting future items. An adaptive way to estimate the probability density is to recursively subdivide the domain to an appropriate data-dependent granularity. A Bayesian would assign a data-independent prior probability to "subdivid... |
Title: Missing values: sparse inverse covariance estimation and an extension to sparse regression |
Abstract: We propose an l1-regularized likelihood method for estimating the inverse covariance matrix in the high-dimensional multivariate normal model in presence of missing data. Our method is based on the assumption that the data are missing at random (MAR) which entails also the completely missing at random case. T... |
Title: On Solving Boolean Multilevel Optimization Problems |
Abstract: Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each individual optimization problem, such that the solution of the resulting aggregated optimization problem solves the original set of... |
Title: Faith in the Algorithm, Part 2: Computational Eudaemonics |
Abstract: Eudaemonics is the study of the nature, causes, and conditions of human well-being. According to the ethical theory of eudaemonia, reaping satisfaction and fulfillment from life is not only a desirable end, but a moral responsibility. However, in modern society, many individuals struggle to meet this responsi... |
Title: Learning for Dynamic subsumption |
Abstract: In this paper a new dynamic subsumption technique for Boolean CNF formulae is proposed. It exploits simple and sufficient conditions to detect during conflict analysis, clauses from the original formula that can be reduced by subsumption. During the learnt clause derivation, and at each step of the resolution... |
Title: Stiffness Analysis of Overconstrained Parallel Manipulators |
Abstract: The paper presents a new stiffness modeling method for overconstrained parallel manipulators with flexible links and compliant actuating joints. It is based on a multidimensional lumped-parameter model that replaces the link flexibility by localized 6-dof virtual springs that describe both translational/rotat... |
Title: Kinematics of A 3-PRP planar parallel robot |
Abstract: Recursive modelling for the kinematics of a 3-PRP planar parallel robot is presented in this paper. Three planar chains connecting to the moving platform of the manipulator are located in a vertical plane. Knowing the motion of the platform, we develop the inverse kinematics and determine the positions, veloc... |
Title: Kinematic and Dynamic Analysis of the 2-DOF Spherical Wrist of Orthoglide 5-axis |
Abstract: This paper deals with the kinematics and dynamics of a two degree of freedom spherical manipulator, the wrist of Orthoglide 5-axis. The latter is a parallel kinematics machine composed of two manipulators: i) the Orthoglide 3-axis; a three-dof translational parallel manipulator that belongs to the family of D... |
Title: Safe Reasoning Over Ontologies |
Abstract: As ontologies proliferate and automatic reasoners become more powerful, the problem of protecting sensitive information becomes more serious. In particular, as facts can be inferred from other facts, it becomes increasingly likely that information included in an ontology, while not itself deemed sensitive, ma... |
Title: Design, development and implementation of a tool for construction of declarative functional descriptions of semantic web services based on WSMO methodology |
Abstract: Semantic web services (SWS) are self-contained, self-describing, semantically marked-up software resources that can be published, discovered, composed and executed across the Web in a semi-automatic way. They are a key component of the future Semantic Web, in which networked computer programs become providers... |
Title: Time Hopping technique for faster reinforcement learning in simulations |
Abstract: This preprint has been withdrawn by the author for revision |
Title: Eligibility Propagation to Speed up Time Hopping for Reinforcement Learning |
Abstract: A mechanism called Eligibility Propagation is proposed to speed up the Time Hopping technique used for faster Reinforcement Learning in simulations. Eligibility Propagation provides for Time Hopping similar abilities to what eligibility traces provide for conventional Reinforcement Learning. It propagates val... |
Title: The Derivational Complexity Induced by the Dependency Pair Method |
Abstract: We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the dependency pair method in terms of the derivational complexity of the base techniques employed. In particular we show that the de... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.