rohan

219 posts

rohan banner
rohan

rohan

@bali2ro

earth observation machine learning and uncertainty under shift , asking when benchmarks fool us.

Boston, MA Katılım Eylül 2023
638 Takip Edilen275 Takipçiler
Kris Gulati
Kris Gulati@krisgulati·
Got offered and turned down a job 10x of my annual childhood household income… we gambling on next years academic market 💪
English
8
0
113
14.6K
Chengpeng Wang
Chengpeng Wang@Chasen86341870·
Excited to share that I will join NUS (@NUSComputing) as an Assistant Professor this Aug! 🎉 I’m recruiting Ph.D./RAs/interns interested in Program Analysis, Code LLMs, and Agents. 🔥 Self-motivated students with strong backgrounds are especially welcome.
English
17
25
352
23.5K
rohan
rohan@bali2ro·
life was boring before i started working on the space time data
English
0
0
3
186
Aryeh Kontorovich
Aryeh Kontorovich@aryehazan·
I'm submitting 400 icml papers wish me luck
English
6
0
133
15.1K
vipli
vipli@viplismism·
why I am seeing so many posts encouraging me to buy crypto?
English
1
0
0
132
Valerio Capraro
Valerio Capraro@ValerioCapraro·
Incredible. One of the world’s most prestigious conferences, NeurIPS 2025, has published over 50 papers containing fake citations, likely hallucinated by generative AI. Several of these papers report affiliations from top-tier institutions, including NYU, Cornell, and Princeton. And this is likely only the tip of the iceberg. If citations are hallucinated, what other parts of the papers are hallucinated as well? Generative AI has the potential to destroy the peer review system and, consequently, trust in published research. The cost of producing a paper is decreasing, while the cost of reviewing remains constant, or is even increasing. This is unsustainable. We really need to radically rethink the review system.
Valerio Capraro tweet media
English
9
31
109
9.8K
rohan
rohan@bali2ro·
@berraksismann the study of emotions in language models is pretty fascinating and pretty crucial to achieve awareness someday.
English
0
0
1
21
rohan
rohan@bali2ro·
im looking for an arXiv CS ML endorsement. please feel free to reach out if anyone could help or know anyone who might. thanks.
English
0
0
2
315
rohan
rohan@bali2ro·
@ahall_research sent you a mail regarding the same, some time back.
English
0
0
0
1
Andy Hall
Andy Hall@ahall_research·
Here's proof that Claude Code can write an entire empirical polisci paper. To validate my claim that AI agents are coming for polisci "like a freight train", today I had Claude Code fully replicate and extend an old paper of mine estimating the effect of universal vote-by-mail on turnout and election outcome...essentially in one shot. After careful prompting, Claude Code: (1) Downloaded the old paper's repo and replicated the past results, translating our old Stata Code into Python (2) Crawled the web to get updated official election data and census data (3) Ran new analyses extending the results through 2024 (4) Created new tables and figures (5) Performed a lit review (6) Wrote a wholly new paper (7) Pushed the whole thing to a new github repo The whole thing took about an hour. This is an insane paradigm shift in how empirical work is done. It also validates the point that several people including @BrendanNyhan made yesterday---it's going to be especially easy to scale observational research with AI. Thanks to @alexolegimas, @arthur_spirling , and many others who gave me feedback. .
Andy Hall tweet media
Andy Hall@ahall_research

Claude Code and its ilk are coming for the study of politics like a freight train. A single academic is going to be able to write thousands of empirical papers (especially survey experiments or LLM experiments) per year. Claude Code can already essentially one-shot a full AJPS-style survey experiment paper (with access to Prolific API). We'll need to find new ways of organizing and disseminating political science research in the very near future for this deluge.

English
95
422
2.1K
706.5K
rohan
rohan@bali2ro·
CS229 online : day 6 : kernel dived deeper into svm optimization techniques, where we proved using reisz representation theorem that the weight is just a linear combination of training examples. explored dual optimization technique as well, basically alternative for the original minimization technique. it further facilitates the use of kernel trick for handling non linear data and making it computationally efficient. which is basically writing the algorithms in terms of their inner products, then mapping it done to increase the dimensionality, and making it easier for the optimal margin classifier to differentiate. hence, taking optimal margin classifier plus adding the kernel trick to it, is nothing but a svm. also, proved how the mercer theorem tells us that if a kernel function is valid then the kernel matrix is always greater than it equal to zero. lastly, l1 norm soft margin svms, they basically are helping the traditional svm with a better ability to handle outliers as they doesn’t build the margin in a hard way as it does for the basic one.
rohan tweet media
rohan@bali2ro

CS229 online : day 5 : support vector machines continued naive bayes, tried laplace smoothening, which is nothing but just adding 1 to the numerator and number of features to the denominator in the probabilistic estimation using bayes rule to avoid the breakdown. dived deeper into multivariate bernoulli event model, for the email spam classification example, but it broke down when the new word was provided. in order to resolve the issue, the generative model for the same, called the multinomial event model. started with support vector machines, which in simple words is turning the parameters into a multi dimensional vector matrix, and then applying linear classifier over it. understood the concept of optimal margin classifier, the relation between functional and geometric margin. basically optimal margin classifier is just choosing parameters to maximize the geometric margin.

English
0
0
5
634
rohan
rohan@bali2ro·
@jlnuijens loved how it doesn’t treat texts as vectors like we do traditionally
English
1
0
0
42
rohan
rohan@bali2ro·
@BhadKingArmani really inspiring brother, yes the growth will come, keep working hard, you’d make it for sure!
English
0
0
1
14
IAmArmani
IAmArmani@BhadKingArmani·
Completely different realities. I'm working from my device with a broken amoled screen. I can't use a warranty till January because vendors are out for the year and I don't have enough for a paid fix. The glare from the 3/4th white out screen is tearing lines into my retina as I work. At least what matters is that the work gets done, I'm optimistic growth will come.
English
1
0
1
81
rohan
rohan@bali2ro·
pov: you’re scanning papers for the algorithm implementations you need while watching the snow blanket the world outside.
rohan tweet media
English
2
0
16
608
Kris Gulati
Kris Gulati@krisgulati·
Unusual request: would anyone that follows me be interested in being a paid RA for something like 100-200 hours? Need to be adept at standard empirical work + ideally a mild familiarity with bibliometric stuff. Flexible on payment. I have a small grant that I need to spend…
English
13
15
125
27.8K
rohan
rohan@bali2ro·
CS229 online : day 5 : support vector machines continued naive bayes, tried laplace smoothening, which is nothing but just adding 1 to the numerator and number of features to the denominator in the probabilistic estimation using bayes rule to avoid the breakdown. dived deeper into multivariate bernoulli event model, for the email spam classification example, but it broke down when the new word was provided. in order to resolve the issue, the generative model for the same, called the multinomial event model. started with support vector machines, which in simple words is turning the parameters into a multi dimensional vector matrix, and then applying linear classifier over it. understood the concept of optimal margin classifier, the relation between functional and geometric margin. basically optimal margin classifier is just choosing parameters to maximize the geometric margin.
rohan tweet media
rohan@bali2ro

CS229 online : day 4 : gaussian discriminant analysis and naive bayes studied the difference between discriminative and generative learning algorithms. how we focus on the input parameters instead of target variable. dived deeper into gaussian discriminant analysis, a generative learning algorithm, where we assumed the probability distribution is gaussian and use mean and the covariance as the parameters which are optimized using maximum likelihood. this function then implies to a sigmoid function which is the decision boundary for the classification. turns out all exponential families implies to the same, i.e. sigmoid function but the vice versa isn’t true. basically, generative learning algorithms can be a good fit for the data with clear known distribution. but for random data logistic regression is better. lastly, naive bayes, another generative learning algorithm, focused on the classic email spam classification, where we assumed that the input is conditionally independent i.e. if “Ant” is a spam, “cant” shouldn’t be a spam. so we remove all the other parameters from the probability chain. then, on parameters using maximum likelihood estimation we get the probability/chances/fraction of a word to be in the spam folder.

English
0
0
8
1.9K
Aayushii
Aayushii@aayushhiiiiii·
@bali2ro oh no. i meant made it to college. that’s a bigger achievement atp
English
1
0
1
83