raluk

13 dagen geledendiscuss

At first glance looks like stipped C++ with minor differences. For example go have row polimorphism compared to OOP in C++. What else is there that C++ does not have?

raluk

28 dagen geledendiscuss

In similar fashon in year 2009 Amazon deleted books from Kindle. One of them was 1984 from George Orwell.

raluk

vorige maanddiscuss

This algebra is also called bicyclic semigroup https://en.wikipedia.org/wiki/Bicyclic_semigroup

raluk

2 maanden geledendiscuss

In C / C++ there are two kinds of undefined behaviour. One is where there is written in standard what UB is. Another one is everthing else that is not in standard.

raluk

4 maanden geledendiscuss

Spending few weeks trying to understand Kalman filterm, I figured out that I need to understand all if the following:

1. Model of system

2. Internal state

3. How is optimal estimation defined

4. Covariance (statistics)

Kalman filter is optimal estimation of internal state and covariance of system based on measurements so far.

Kalman process/filter is mathematical solution to this problem as the system is evolving based on input and observable measurements. Turns out that internal state that includes both estimated value and covariance is all that is needed to fully capture internal state for such model.

It is important to undrstand, that having different model for what is optimum, uncertenty or system model, compared to what Rudolf Kalman presented, gives just different mathematical solution for this problem. Examples of different optimal solutions for different estimation models are nonlinear Kalman filters and Wiener filter.

---

I think that book on this topic from author Alex Becker is great and possibly best introduction into this topic. It has lot of examples and builds requred intuition really well. All I was missing is little more emphasis into mathematical rigor and chapter about LQG regulator, but you can find both of this in original paper by Rudolf Kalman.

raluk

7 maanden geledendiscuss

It improves immune system and geneal wellbeing. It is pain that you can get used to and I kind of enyoj it now in some weird way. It is hard, requires some dedication and brings some benefits, but does not requre extra time or planning. Great morale booster.

raluk

7 maanden geledendiscuss

Over the hollidays I was working on Steve Balmers interview puzzle. https://rahne.si/optimisation/2026/01/07/steve-ballmer-inter...

What I am most proud of is that I got the solution in the corse of apporx 1 week working on this!

raluk

7 maanden geledendiscuss

Using only cold water for showers.

raluk

7 maanden geledendiscuss

What are protental issues with compiler, by just disabling borrow checker? If I recall correctly some compiler optimisations for rust can not be done in C/C++ because of restrictions implied by borrow checker.

raluk

7 maanden geledendiscuss

"Math nerd explains how to spend 3 days proving 1+1=2" -> Original "From Zero to QED: An informal introduction to formality with Lean 4" https://news.ycombinator.com/item?id=46259343

raluk

8 maanden geledendiscuss

Years ago I wrote c++ library for stream compostion. Something like C++20 ranges. It turns out that as long as you compose everything with lambdas, compiled code is same as it would be with naive loops. Everything gets optimised.

For example, you can write sum of numbers less than n as:

  count(uint64_t(0)) 
   | take(n) 
   | sum<uint64_t>();

Clang converted this into n*(n-1)/2.

raluk

10 maanden geledendiscuss

How much is fft used for AI? Seems that attention and convolution could benefit from this.

raluk

11 maanden geledendiscuss

Having lexicial scope it is same as -> defer fn{if(some condition) x() }() within scope.

raluk

11 maanden geledendiscuss

Given that you die, when one vital organ dies it will eventaully hapen in this way or another. I read somwhere and that stuck in my brain, that maxmimal logevity for humans is estimated to be approximetly 125 years.

raluk

vorig jaardiscuss

This is what i hand in mind whit "manually handing of futures". In this case you have to write

   Promise1 = f1(); Promise2 = f2();
   v1,v2 = await Join(Promise1, Promise2);
   return v1 + v2

I think this is just too much of synthactic noise.

On the other hand, it is necessary becase some of underlying async calls can be order dependend.

for example

    await sock.rec(1) == 'A' && await sock.rec(1) == 'B'

checks that first received socket byte is A and second is B. This is clearly order dependant that can't be executed concurrently out of order.

raluk

vorig jaardiscuss

In there is also ApplicativeDo that works nicely with this.

    do 
      x <- f1
      y <- f2
      return $ x + y

this is evaluated as applicative in same way.

raluk

vorig jaardiscuss

One thing that most languages are lacking is expressing lazy return values. -> await f1() + await f2() and to express this concurently requres manually handing of futures.

raluk

vorig jaardiscuss

Great exercise driven course is: https://github.com/system-f/lets-lens

raluk

vorig jaardiscuss

https://blog.jle.im/entry/lenses-products-prisms-sums.html

raluk

vorig jaardiscuss

Our team is working with soniox.com They are the most acurate model that works real time.

Submissions

Soniox released STT model v3 - A new standard for understanding speech

comments