Skip to content
Snippets Groups Projects
Commit d19ea80d authored by Bas Nijholt's avatar Bas Nijholt
Browse files

simplify code

parent 878b8975
No related branches found
No related tags found
No related merge requests found
Pipeline #21271 passed
......@@ -146,12 +146,9 @@ When querying $n>1$ points, the former procedure simply repeats $n$ times.
<!-- example of distance loss on singularities -->
```python
from adaptive import Learner1D, Runner
from module import complicated_function
from module import complicated_function as f
learner = Learner1D(
complicated_function,
bounds=(-1, 1),
)
learner = Learner1D(f, bounds=(-1, 1))
def goal(learner):
return learner.loss() < 0.01
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment