Age | Commit message (Collapse) | Author | Lines | |
---|---|---|---|---|
2021-02-26 | add simple decisiontree test | Daniel Friesel | -1/+1 | |
2021-02-25 | kinda proper dtree support (todo: refactoring) | Daniel Friesel | -7/+30 | |
2021-02-25 | pelt_refine: Fix "no sub-states" handling | Daniel Friesel | -1/+1 | |
2021-02-25 | Adjust ParamStats interface in preparation for decision-tree models | Daniel Friesel | -23/+178 | |
2021-02-24 | cluster and re-fit sub-states | Daniel Friesel | -72/+91 | |
2021-02-24 | lut_median_getter: handle param tuples, not just lists | Daniel Friesel | -1/+4 | |
2021-02-24 | do not hard-code substate names | Daniel Friesel | -8/+11 | |
2021-02-24 | treat last sub state as tail / default state | Daniel Friesel | -7/+16 | |
use application-provided total state duration instead of model to determine duration of last sub-state in get_fitted_sub | ||||
2021-02-24 | pelt: allow contraction (averaging) of data as well as stretching | Daniel Friesel | -2/+23 | |
2021-02-23 | draft for clustering of parameter-independent sub-states | Daniel Friesel | -91/+96 | |
2021-02-23 | fix drift compensation and reduce pelt + caching overhead | Daniel Friesel | -44/+60 | |
2021-02-23 | analyze-archive: show substate model quality in table | Daniel Friesel | -1/+15 | |
2021-02-22 | add simple sub-state model accessor and evaluation | Daniel Friesel | -2/+34 | |
2021-02-22 | properly handle static submodel attributes | Daniel Friesel | -31/+42 | |
TODO: fitting and submodel usage in parent | ||||
2021-02-22 | PELT: Increase parallelism | Daniel Friesel | -86/+107 | |
2021-02-19 | start modeling of individual sub-states | Daniel Friesel | -19/+109 | |
2021-02-18 | pelt: Set minimum penalty to 1, improve cache layout | Daniel Friesel | -11/+19 | |
2021-02-18 | pelt: add tail substate | Daniel Friesel | -3/+5 | |
2021-02-18 | pelt: cache changepoint detection results | Daniel Friesel | -5/+65 | |
2021-02-18 | refactor model generation from Analytic/PTAModel into ModelAttribute class | Daniel Friesel | -577/+395 | |
Iteration over states/transitions and model attributes is no longer hardcoded into most model generation code. This should make support for decision trees and sub-states much easier. | ||||
2021-02-15 | pelt: Fix stretch != 1 support | Daniel Friesel | -2/+4 | |
2021-02-15 | loader: energytrace: add timestamps to support data | Daniel Friesel | -1/+6 | |
2021-02-15 | debug output | Daniel Friesel | -8/+15 | |
2021-02-15 | Limit PELT via --with-substates=name_filter=state_or_transition_name | Daniel Friesel | -12/+13 | |
2021-02-15 | needs_refinement: short traces cannot be reliably refined | Daniel Friesel | -1/+3 | |
2021-02-12 | PELT: use variable penalty for benchmark repetations | Daniel Friesel | -40/+64 | |
Previously, the first measurement of each by_param entry determined its penalty, and all subsequenc measurements in it were analyzed with this penalty. This lead to some of them coming up with a different number of sub-states and being ignored. Now, all by_param entries are passed to the kneedle / plateau algorithm, and each gets its own penalty. In most cases, this leads to all entries rporting the same number of sub-states, so far less need to be ignored. | ||||
2021-02-12 | Add support data (e.g. power traces) for transitions too. Fixes plots and PELT. | Daniel Friesel | -1/+1 | |
2021-01-20 | greedy drift compensation: Handle left corner case as well. Oops. | Daniel Friesel | -2/+11 | |
2021-01-19 | additional debugging output | Daniel Friesel | -1/+16 | |
2021-01-19 | fix off-by-one in graph-based drift compensation | Daniel Friesel | -1/+1 | |
the bug manifested whenever a "transition end" node was chosen | ||||
2021-01-19 | sort keys before bisect | Daniel Friesel | -1/+1 | |
2021-01-19 | greedy drift compensation: handle edge cases | Daniel Friesel | -2/+8 | |
2021-01-19 | drift compensation: use PILT min_dist=1 | Daniel Friesel | -1/+1 | |
2021-01-19 | greedy drift compensation: consider transition start vs end when syncing | Daniel Friesel | -46/+38 | |
2021-01-18 | re-add greedy drift compensation heuristic | Daniel Friesel | -3/+86 | |
2021-01-18 | drift compensation: a candidate may refer to transition start or end | Daniel Friesel | -39/+69 | |
There's still a major bug somewhere, right now results are sub-par | ||||
2021-01-18 | energytrace drift compensation: allow arbitrarily long skips | Daniel Friesel | -29/+33 | |
2021-01-18 | energytrace drift compensation: stretch datapoints | Daniel Friesel | -1/+3 | |
2021-01-18 | drift_compensation_grpah: handle node skips at the tail | Daniel Friesel | -0/+9 | |
2021-01-18 | refactor graph-based drift compensation into a separate function | Daniel Friesel | -1/+12 | |
2021-01-18 | Fix a typo | Daniel Friesel | -1/+1 | |
2021-01-18 | EnergyTrace loader: show offline_index in debug and error output | Daniel Friesel | -8/+23 | |
2021-01-15 | pelt: add stretch parameter | Daniel Friesel | -0/+20 | |
2021-01-15 | pelt: Fix Dynp support | Daniel Friesel | -1/+5 | |
2021-01-14 | add anoter todo entry | Daniel Friesel | -0/+3 | |
2021-01-14 | energytrace drift compensation: handle arbitrarily long detection failures | Daniel Friesel | -19/+6 | |
2021-01-14 | energytrace drift compensation: partially handle lack of candidates | Daniel Friesel | -2/+4 | |
2021-01-14 | energytrace drift compensation: Handle undetected transitions | Daniel Friesel | -5/+76 | |
2021-01-14 | EnergyTrace drift compensation: optimize via shortest paths | Daniel Friesel | -72/+88 | |
Right now performance is worse than the previous greedy approach as the dijkstra variant does not take into account that a transition may be missing from the set of detected changepoints (i.e., it assumes that the set of detected changepoints contains the transition timestamp, which is not always the case). This will be fixed in the next commit by adding nodes for the expected transition timestamp (with a slightly higher weight to ensure there are no proper nodes in the vicinity) -- or something similar. | ||||
2021-01-13 | pelt: Allow overrides via environment variables | Daniel Friesel | -4/+23 | |