A Scrambled Method of Moments
Quasi-Monte Carlo (qMC) methods are a powerful alternative to classical Monte-Carlo (MC) integration. Under certain conditions, they can approximate the desired integral at a faster rate than the usual Central Limit Theorem, resulting in more accurate estimates. This paper explores these methods in a simulation-based estimation setting with an emphasis on the scramble of Owen (1995). For cross-sections and short-panels, the resulting Scrambled Method of Moments simply replaces the random number generator with the scramble (available in most softwares) to reduce simulation noise. Scrambled Indirect Inference estimation is also considered. For time series, qMC may not apply directly because of a curse of dimensionality on the time dimension. A simple algorithm and a class of moments which circumvent this issue are described. Asymptotic results are given for each algorithm. Monte-Carlo examples illustrate these results in finite samples, including an income process with "lots of heterogeneity."
Code (0)
등록된 구현이 없습니다.
Tasks
Time SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Unnatural Error Correction: GPT-4 Can Almost Perfectly Handle Unnatural Scrambled Text
While Large Language Models (LLMs) have achieved remarkable performance in many tasks, much about their inner workings remains unclear. In this study, we present novel experimental insights into the resilience of LLMs, p…
When does word order matter and when doesn't it?
Language models (LMs) may appear insensitive to word order changes in natural language understanding (NLU) tasks. In this paper, we propose that linguistic redundancy can explain this phenomenon, whereby word order and o…
Natural Language UnderstandingRTESST-2Scrambled Translation Problem: A Problem of Denoising UNMT
In this paper, we identify an interesting kind of error in the output of Unsupervised Neural Machine Translation (UNMT) systems like \textit{Undreamt}(footnote). We refer to this error type as \textit{Scrambled Translati…
DenoisingMachine TranslationSentenceTranslationDependency Analysis of Scrambled References for Better Evaluation of Japanese Translation
Solving Rubik's Cube Without Tricky Sampling
The Rubiks Cube, with its vast state space and sparse reward structure, presents a significant challenge for reinforcement learning (RL) due to the difficulty of reaching rewarded states. Previous research addressed this…
Policy Gradient MethodsReinforcement Learning (RL)Rubik's Cube