Your observation is likely over fitting to some of the CDs tied to risker banks.
396 karma · joined July 26, 2019
Your observation is likely over fitting to some of the CDs tied to risker banks.
If they took large losses or lent out too much, inflation would skyrocket.
yields dropped almost 1 point after depositor bailouts for SVB. the running belief is that the fed will slow down in response to fixed-income positions held by banks.
It's equivalent to buying the bond that represents the debt you owe.
Larger debt ends up in negotiations over the amount owed. War debt after WW1 resulted in greatly reduced repayments based on the original lending.
If you are a default risk on debt that has weak collateral, you could probably come to some agreement that pays back some fraction of the principal.
Although doesn't that defeat the purpose of structured concurrency?
i.e. creating tasks that are plumbed to some background thread/executor.
By directly invoking the coroutine, lifetime issues become much easier to avoid.
So saying that coroutines are low-level / not application code is misguided.
Maybe it will tend towards everyone sounding the same. Which then gets amplified as LLMs train on writing that is essentially mutations of itself.
Me no like.
They need
1. Recommendation systems experience
2. Machine Learning
3. Auction theory
4. Ads pacing
5. ML / Reinforcement learning
Gee, I wonder what they're scaling out...
Let's define "long haulers" as those exhibiting system after Y months.
The percentage of long haulers is 0.25 <= X <= 1.
We need to replace 0.75 with
0 <= 1 - (X / 0.25) <= 0.75
Lower corporate taxation incentivizes the hoarding of cash. Prior, corporations were incentivized to allocate more funding towards their industry research (IBM, Bell Labs, etc).
Would love some counterarguments, here!
Binaries are deployed and scaled independently as thrift services.
Tons of rpc.
Just vanilla C++ classes, and virtual interfaces if we need to mock things for unit tests.
No automatic wiring of the hierarchy.
DAG may too specific. It's really a dependency graph, that likely has a DAG topology.
Open source analogue would be Apache Airflow.
Abstractly, it's some directed acrylic graph (DAG) that is asynchronously computed, sometimes on a schedule.
Unfortunately, most things fall under DAG. But the framework / engine exists to manage the complexity of the ever-extending pipelines declared by the engineers
Event/push-based workflows also fall under this taxonomy.
IDL := Interface Description Language
TLA := linked article
The underlying executors come from folly.
Request passed to a thread pool. Each thread is juggling coroutines representing in flight requests
Specifically, this model is an ensemble of decision trees.
This involves
1. Row lookup
2. N (tree depth) inequality checks on fields in the row for M trees
3. Weighted sum over M trees
i.e. -> in other words
D wave is not a quantum computer. It is a specialized hardware for solving certain classes of optimization problems using quantum annealing.
in his example, let's say there's some 3-cycle (123) the cuber knows. But really, the cuber wants to transform like (479).
Conjugation being equivalent to a group action implies the cuber only needs to find a group that permutes 1->4, 2->7, 3->9.
Let's say one is found: (14)(27)(39)...
gTg' => [(14)(27)(39)...](123)[(14)(27)(39)...]' = (479)
Annual numbers are also canon.
People think on yearly timescales