English
Related papers

Related papers: Future-blindness and the product topology

200 papers

User interests are usually dynamic in the real world, which poses both theoretical and practical challenges for learning accurate preferences from rich behavior data. Among existing user behavior modeling solutions, attention networks are…

Information Retrieval · Computer Science 2022-04-14 Chao Chen , Haoyu Geng , Nianzu Yang , Junchi Yan , Daiyue Xue , Jianping Yu , Xiaokang Yang

We give a definitive treatment of duality for optimal consumption over the infinite horizon, in a semimartingale incomplete market satisfying no unbounded profit with bounded risk (NUPBR). Rather than base the dual domain on (local)…

Portfolio Management · Quantitative Finance 2021-12-21 Michael Monoyios

The quick and pervasive infiltration of decision support systems, artificial intelligence, and data mining in consumer electronics and everyday life in general has been significant in recent years. Fields such as UX have been facilitating…

Databases · Computer Science 2018-04-13 Giovanni Vincenti

We introduce an extension to Merton's famous continuous time model of optimal consumption and investment, in the spirit of previous works by Pliska and Ye, to allow for a wage earner to have a random lifetime and to use a portion of the…

Portfolio Management · Quantitative Finance 2011-02-14 I. Duarte , D. Pinheiro , A. A. Pinto , S. R. Pliska

Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…

Logic in Computer Science · Computer Science 2016-03-04 Edward Hermann Haeusler

An experimenter seeks to learn a subject's preference relation. The experimenter produces pairs of alternatives. For each pair, the subject is asked to choose. We argue that, in general, large but finite data do not give close…

Theoretical Economics · Economics 2018-08-01 Christopher P. Chambers , Federico Echenique , Nicolas S. Lambert

Time series forecasting using historical data has been an interesting and challenging topic, especially when the data is corrupted by missing values. In many industrial problem, it is important to learn the inference function between the…

Machine Learning · Computer Science 2023-06-02 Trang H. Tran , Lam M. Nguyen , Kyongmin Yeo , Nam Nguyen , Dzung Phan , Roman Vaculin , Jayant Kalagnanam

We bound features of counterfactual choices in the nonparametric random utility model of demand, i.e. if observable choices are repeated cross-sections and one allows for unrestricted, unobserved heterogeneity. In this setting, tight bounds…

Econometrics · Economics 2019-05-21 Yuichi Kitamura , Jörg Stoye

This paper is concerned with learners who aim to learn patterns in infinite binary sequences: shown longer and longer initial segments of a binary sequence, they either attempt to predict whether the next bit will be a 0 or will be a 1 or…

Logic in Computer Science · Computer Science 2020-09-15 Gordon Belot

We introduce a functor which associates to every measure preserving system (X,B,\mu,T) a topological system (C_2(\mu),\tilde{T}) defined on the space of 2-fold couplings of \mu, called the topological lens of T. We show that often the…

Dynamical Systems · Mathematics 2009-01-12 Eli Glasner , Mariusz Lemanczyk , Benjamin Weiss

This paper studies temporal planning in probabilistic environments, modeled as labeled Markov decision processes (MDPs), with user preferences over multiple temporal goals. Existing works reflect such preferences as a prioritized list of…

Formal Languages and Automata Theory · Computer Science 2023-04-25 Lening Li , Hazhar Rahmani , Jie Fu

Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…

Logic in Computer Science · Computer Science 2020-12-24 Ugo Dal Lago , Claudia Faggian , Simona Ronchi Della Rocca

In this paper, we develop a deep neural network approach to solve a lifetime expected mortality-weighted utility-based model for optimal consumption in the decumulation phase of a defined contribution pension system. We formulate this…

General Finance · Quantitative Finance 2020-07-28 Wen Chen , Nicolas Langrené

In our previous paper [9], we have introduced topological nearly entropy, Ent_N (f) by restricting X into a class of nearly compact spaces. In the present paper, some additional properties of this notion are studied. Furthermore, we…

Dynamical Systems · Mathematics 2019-08-07 Zabidin Salleh , Syazwani Gulamsarwar

Timed automata (TAs) are an extension of finite automata that can measure and react to the passage of time, providing the ability to handle real-time constraints using clocks. In 2009, Franck Cassez showed that the timed opacity problem,…

Logic in Computer Science · Computer Science 2026-03-30 Étienne André , Sarah Dépernet , Engel Lefaucheux

Individuals use models to guide decisions, but many models are wrong. This paper studies which misspecified models are likely to persist when individuals also entertain alternative models. Consider an agent who uses her model to learn the…

Theoretical Economics · Economics 2023-08-22 Cuimin Ba

We study a general robust utility maximization problem in a discrete-time frictionless market. The investor is assumed to have a possibly infinite, random, nonconcave, and nondecreasing utility function defined on the whole real line. She…

Mathematical Finance · Quantitative Finance 2025-10-14 Laurence Carassus , Massinissa Ferhoune

Is an option especially tempting when it is both immediate and certain? I test the effect of risk on the present-bias factor given quasi-hyperbolic discounting. In my experiment workers allocate about thirty to fifty minutes of real-effort…

General Economics · Economics 2024-08-28 J. Lucas Reddinger

Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…

Formal Languages and Automata Theory · Computer Science 2022-05-20 Nathanaël Fijalkow , Cristian Riveros , James Worrell

While Bellman equations for basic reach, avoid, and reach-avoid problems are well studied, the relationship between value optimality and policy optimality becomes subtle in the undiscounted infinite-horizon setting, particularly for more…

Robotics · Computer Science 2026-05-05 Oswin So , William Sharpless , Sylvia Herbert , Chuchu Fan