Details
Joined devRant on 4/22/2017
Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API

From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
i have figured out the PTSD from my job is just fear and evidently I've never had fear so I was confused
was always an angry kid so I guess I never felt fear before then...
... also apparently all fear is caused by thinking you'll lose freedoms
my job was like a prison... except then I figured out how prisons are, and a prison would be a utopia
so now I literally just can't even bring myself to reply to interview emails cuz I just feel "fear" at them... which I thought was PTSD
and fear always seems big and functions irrationally... and not having experienced it I didn't know that obvious tidbit -.-
all I knew is I was "broken" somehow by that whole experience, even though at the time it didn't seem like such a big deal
people think if you're unemployed you'll just "get off your ass and stop being lazy" when they starve you to death, but starving you to death is just another fear. the first fear and the second breed and power each other up like a reverberating resonance. I rather starve to death than go back to prison so that was never helpful "advice" to me
I've generally been an angry person. I've been fearless quite literally and pretty chill, but when people push on me I get angry though don't necessarily show it. while working I was angry all the time. the interesting thing I noticed about anger is the resonance -- the angry CEO potentially being angry at me didn't scare me, and one time he was finally angry at me. the interesting result was that instead I couldn't keep a lid on my own anger. I got angry at him back. this made me realize you can't suppress an emotion if someone else is throwing the same emotion at you -- it just powers them both up
anger is about territory. either you want something or you're protecting something. it's important to you. anger also seems to dispel fear. ran into something recently and it said "fear is dispelled if you have something more important". just "surviving" is not more important than being free to me, so "starving to death until you get off your lazy ass" was the most annoying bullshit
I've noticed if I'm mad at a job-related person I feel no fear. the anger dispels it. because I was mad at that job all the time, I don't think I noticed my fear. they were frequently using coercion as a "motivational" strategy on everyone... and even though I didn't react to it or was motivated by it, they didn't adapt and try different motivations. I figured I agreed to be doing this, so there's no point in threatening me, and just ignored it. but they never stopped. and things got shittier and shittier. the price they paid me to tank my freedom for purely arbitrary means was just too low, and I couldn't feel any of it because I was angry all the time
I interviewed at companies fine before I left. now that I left I actually can't. because there's no anger. I'm happy. so there's nothing to dispel the fear. therefore I'm cursed, broken, and non-functional... from some mystery I could never figure out before
and I know, this, also. because any time I was harmed socially in these years since, suddenly I could function again, because I was angry, and suddenly I could do so much. but who wants to live life purely angry just to function? it didn't feel right to me. I was so confused6 -
Adaptive Latent Hypersurfaces
The idea is rather than adjusting embedding latents, we learn a model that takes
the context tokens as input, and generates an efficient adapter or transform of the latents,
so when the latents are grabbed for that same input, they produce outputs with much lower perplexity and loss.
This can be trained autoregressively.
This is similar in some respects to hypernetworks, but applied to embeddings.
The thinking is we shouldn't change latents directly, because any given vector will general be orthogonal to any other, and changing the latents introduces variance for some subset of other inputs over some distribution that is partially or fully out-of-distribution to the current training and verification data sets, thus ultimately leading to a plateau in loss-drop.
Therefore, by autoregressively taking an input, and learning a model that produces a transform on the latents of a token dictionary, we can avoid this ossification of global minima, by finding hypersurfaces that adapt the embeddings, rather than changing them directly.
The result is a network that essentially acts a a compressor of all relevant use cases, without leading to overfitting on in-distribution data and underfitting on out-of-distribution data.13 -
The biggest challenge of building a free energy device is figuring out where to hide the battery.
The biggest challenge of building an AI product is figuring out where to hide API calls to ChatGPT.2 -
Hey, been gone a hot minute from devrant, so I thought I'd say hi to Demolishun, atheist, Lensflare, Root, kobenz, score, jestdotty, figoore, cafecortado, typosaurus, and the raft of other people I've met along the way and got to know somewhat.
All of you have been really good.
And while I'm here its time for maaaaaaaaath.
So I decided to horribly mutilate the concept of bloom filters.
If you don't know what that is, you take two random numbers, m, and p, both prime, where m < p, and it generate two numbers a and b, that output a function. That function is a hash.
Normally you'd have say five to ten different hashes.
A bloom filter lets you probabilistic-ally say whether you've seen something before, with no false negatives.
It lets you do this very space efficiently, with some caveats.
Each hash function should be uniformly distributed (any value input to it is likely to be mapped to any other value).
Then you interpret these output values as bit indexes.
So Hi might output [0, 1, 0, 0, 0]
while Hj outputs [0, 0, 0, 1, 0]
and Hk outputs [1, 0, 0, 0, 0]
producing [1, 1, 0, 1, 0]
And if your bloom filter has bits set in all those places, congratulations, you've seen that number before.
It's used by big companies like google to prevent re-indexing pages they've already seen, among other things.
Well I thought, what if instead of using it as a has-been-seen-before filter, we mangled its purpose until a square peg fit in a round hole?
Not long after I went and wrote a script that 1. generates data, 2. generates a hash function to encode it. 3. finds a hash function that reverses the encoding.
And it just works. Reversible hashes.
Of course you can't use it for compression strictly, not under normal circumstances, but these aren't normal circumstances.
The first thing I tried was finding a hash function h0, that predicts each subsequent value in a list given the previous value. This doesn't work because of hash collisions by default. A value like 731 might map to 64 in one place, and a later value might map to 453, so trying to invert the output to get the original sequence out would lead to branching. It occurs to me just now we might use a checkpointing system, with lookahead to see if a branch is the correct one, but I digress, I tried some other things first.
The next problem was 1. long sequences are slow to generate. I solved this by tuning the amount of iterations of the outer and inner loop. We find h0 first, and then h1 and put all the inputs through h0 to generate an intermediate list, and then put them through h1, and see if the output of h1 matches the original input. If it does, we return h0, and h1. It turns out it can take inordinate amounts of time if h0 lands on a hash function that doesn't play well with h1, so the next step was 2. adding an error margin. It turns out something fun happens, where if you allow a sequence generated by h1 (the decoder) to match *within* an error margin, under a certain error value, it'll find potential hash functions hn such that the outputs of h1 are *always* the same distance from their parent values in the original input to h0. This becomes our salt value k.
So our hash-function generate called encoder_decoder() or 'ed' (lol two letter functions), also calculates the k value and outputs that along with the hash functions for our data.
This is all well and good but what if we want to go further? With a few tweaks, along with taking output values, converting to binary, and left-padding each value with 0s, we can then calculate shannon entropy in its most essential form.
Turns out with tens of thousands of values (and tens of thousands of bits), the output of h1 with the salt, has a higher entropy than the original input. Meaning finding an h1 and h0 hash function for your data is equivalent to compression below the known shannon limit.
By how much?
Approximately 0.15%
Of course this doesn't factor in the five numbers you need, a0, and b0 to define h0, a1, and b1 to define h1, and the salt value, so it probably works out to the same. I'd like to see what the savings are with even larger sets though.
Next I said, well what if we COULD compress our data further?
What if all we needed were the numbers to define our hash functions, a starting value, a salt, and a number to represent 'depth'?
What if we could rearrange this system so we *could* use the starting value to represent n subsequent elements of our input x?
And thats what I did.
We break the input into blocks of 15-25 items, b/c thats the fastest to work with and find hashes for.
We then follow the math, to get a block which is
H0, H1, H2, H3, depth (how many items our 1st item will reproduce), & a starting value or 1stitem in this slice of our input.
x goes into h0, giving us y. y goes into h1 -> z, z into h2 -> y, y into h3, giving us back x.
The rest is in the image.
Anyway good to see you all again.27 -
It’s not wise to play chess with a pigeon. It will throw all pieces away, shit on the board and tell everybody it won.10
-
Questions in job applications have become a fucking joke.
I'm done with them, from now on to stupid questions I'm only answering in same fashion.5 -
🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡🤡5
-
Curtains on, lights off, cats out
it's just me and my bonsai now
I don't even need a tight belt, I don't feel hungry anymore5 -
Sleeping well cleans our mind and let us approach a problem in a different way and help us find the solution. For some days I was worried about how to solve a couple of bugs, but this morning after a good sleep I magically realized how easy the solution was:
WON'T FIX2 -
Woke up feeling like shit. 2 of my kids were puking their guts out. I had stuffy nose and didn't want to exist. So I slept until 1:30pm. Woke up to work on setting up my new computer. I have been working on it since Sunday.
I finally got my old computer backed up to an external 8GB drive. I use Aomei and I like it. I needed backup software for the new computer. I thought about getting Aomei pro again. I went looking through my emails from them and saw I can buy a license for 5 computers forever for like $50 or something. The retail is about $300 or something. The cost of 1 license on page with deals was like $70 forever. I say forever as they have yearly fee model I don't want. The others are a single price once forever. Free updates too. So anyway I get the 5 license thing. Now I have 2 licenses so I can outfit 6 computers. Nice deal. The $50 was better than their general sale price of like $90.
Anyway so I am working on the new computer finding all the shit I hate about Windows 11. I am confronted with a fucking default setting for every folder to sort by date grouping on the files. This is the single worse default I have ever seen in a file manager. So I figured out how to apply a default to all folders to turn grouping to None. Yeah. Then I go download stuff using Firefox and it is fucking grouping things by date in the Save dialogs! WTF is this shit?!
I search about Firefox and they said its a Windows default setting. I find I can right click in dialog to set grouping to None again. But I have to do this on every fucking directory! Fuck you windows. I finally break down I use this third party tool called WinSetView. I am kind of not wanting to have to use third party shit. But I have been staring at this POS problem for like 2 hours. Oh, yeah, even as admin I cannot change the registry key that would set the default to None. Fuck you windows.
So I use WinSetView and it works very fast. I check and it seems to have done the job. Time will tell on this. I cannot tell 100% because all my folders were tweaked every time I right clicked in the save dialog. I also learned these tweaks might be limited to 5000 total in the registry. What a shit show. At some point during this I submitted feedback to Microfsoft to fix this. We shouldn't be editing the registry to fix preferences.
Another issue I had was right clicking a file brings some shitty ass new dialog. It requires another click to be able to do thing like create a shortcut or scan a file with av. It also makes it so I have to either click again or hold down shift to unzip with 7z. I was already tired of this shit. I was going to try tweaking it with registry, but figured I would learn how to shift click. Best of both world? However WinSetView after I ran it fixed this shit show too! Happy surprise!
Friends don't let friends run Windows. But if you have to friends don't let friends run Windows 11 without WinSetView.
I am sure I will have things to complain about. Like firefox having a skinny scrollbar by default. Fuck you Firefox!1 -
At 14, my grandpa had a boyscout trip to Britany, france. He met my grandma near a fountain, they exchanged their address and started communicating.
They exchanged letter for ten years. In the meanwhile, she had married a man and had a child. But the husband unfortunately died of tuberculosis.
So they met 10 years later, at the same fountain, and he brought her to belgium to spend their life together.
RIP bonne maman you were the best1 -
if someone in the group blames you for something, do you "accept responsibility" even if you didn't do the thing?
why or why not?5 -
pLeAsE dOnAtE tO hElP mE aFfOrD hOsTing
lolwut? you have a free-for-all project with no premium features. Users can’t create accounts. All of your code is JS, you don’t even need a server. Just host your stuff on Cloudflare. I have just about a gigabyte of data uploaded there on my free account, so if I can do it, so do you. Just use a CDN for your client-only, JS-only project.
domains though… yours is long and costs around 40 bucks a YEAR.
if you made a good product and want to make some money with it, that’s completely okay, so just say so: “I want money for my work, but I don’t want to take away features that were free and can be provided at no additional cost, so please donate”. Why lie? It’s not like people who won’t donate to you based on this justification will magically donate for “hosting”.4 -
Context/Prev: https://devrant.com/rants/9820310 (and the rants related to it)
So after accidentaly using Arch for 5 months, and then accidentally using Gentoo for 7 months
(It was supposed to be 1 month per distro, but life happened and didn't have the time and peace of mind for a switch)
Today I'm finally hopping to Slackware
I love the setup's retro/classic ncurses gui <311 -
OLDIE BUT GOODIE
https://devrant.com/rants/2376967/...
So now that it's been 5 years how are you planning to spend your social credits?9 -
Monday: trump and musk are best friends now
Tuesday: trump is jealous of musk
Wednesday: trump and musk are fighting
Jeez these two should bang. Americans are such children lmao4 -
I'm the type of girl that can write a 100-line SQL migration without autocomplete, AI and copying-and-pasting and make it run correctly on the first try.10
-
Been nearly 3 years since I last posted on DevRant, a lot has changed, but users are still usering….1