paper-with-me

홈 › Papers

Locating Changes in Highly Dependent Data with Unknown Number of Change Points

2012-12-01 · NeurIPS 2012 12 · Azadeh Khaleghi, Daniil Ryabko

The problem of multiple change point estimation is considered for sequences with unknown number of change points. A consistency framework is suggested that is suitable for highly dependent time-series, and an asymptotically consistent algorithm is proposed. In order for the consistency to be established the only assumption required is that the data is generated by stationary ergodic time-series distributions. No modeling, independence or parametric assumptions are made; the data are allowed to be dependent and the dependence can be of arbitrary form. The theoretical results are complemented with experimental evaluations.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Time SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

Allocating Divisible Resources on Arms with Unknown and Random Rewards

2023-06-28 · Ningyuan Chen, Wenhao Li

We consider a decision maker allocating one unit of renewable and divisible resource in each period on a number of arms. The arms have unknown and random rewards whose means are proportional to the allocated resource and…

Censored Semi-Bandits for Resource Allocation

2021-04-12 · Arun Verma, Manjesh K. Hanawal, Arun Rajkumar, Raman Sankaran

We consider the problem of sequentially allocating resources in a censored semi-bandits setup, where the learner allocates resources at each step to the arms and observes loss. The loss depends on two hidden parameters, …

Multi-Armed Bandits

Quantum Inspired Chaotic Salp Swarm Optimization for Dynamic Optimization

2024-01-21 · Sanjai Pathak, Ashish Mani, Mayank Sharma, Amlan Chatterjee

Many real-world problems are dynamic optimization problems that are unknown beforehand. In practice, unpredictable events such as the arrival of new jobs, due date changes, and reservation cancellations, changes in param…

Adversarial Example Generation using Evolutionary Multi-objective Optimization

2019-12-30 · Takahiro Suzuki, Shingo Takeshita, Satoshi Ono

This paper proposes Evolutionary Multi-objective Optimization (EMO)-based Adversarial Example (AE) design method that performs under black-box setting. Previous gradient-based methods produce AEs by changing all pixels o…

Face Alignment at 3000 FPS via Regressing Local Binary Features

2014-06-01 · CVPR 2014 6 · Shaoqing Ren, Xudong Cao, Yichen Wei, Jian Sun

This paper presents a highly efficient, very accurate regression approach for face alignment. Our approach has two novel components: a set of local binary features, and a locality principle for learning those features. T…

Face Alignmentregression