246 karma · joined January 2, 2019
1) Sony XM3 headphones. They are the 2nd most comfortable after the Bose headphones and have the best NC. So far, nothing you haven't done before.
2) High quality foam earplugs. I have the Mack's Ultra Soft plugs, with 32 decibel noise reduction rating. Anything with 27 decibel reduction or above should be good enough though. You may need to alternate between a few brands and variants before you find one that's comfortable enough to go many hours with.
3) Pink Noise. Play it quite softly so that you can barely even hear it at all with the plugs in. It helps to drown out the remaining external noises that come through without registering in your brain as extra noise itself (which is why I play pink noise instead of other suggestions such as calming music). I like this one: https://youtu.be/8SHf6wmX5MU
I combine all 3 for the nosiest areas like studying in a busy cafe, but you won't usually need the whole stack.
This paragraph makes it sound like they invented the entire idea of using numerical experiments to find promising paths for analytic studies.
https://www.coursehero.com/sitemap/schools/234-University-of...
Many optimization problems that arise in machine learning can be viewed as minimizing a particular Bregman distance subject to affine constraints (I'll call these "Bregman distance optimization problems").
In [1], the authors develop some quite general and widely applicable convex analysis type results for Bregman distances and use those results to give the technique of "Auxiliary Functions" which can be used to derive and prove the convergence of algorithms for particular Bregman distance optimization problems.
In [2], the authors show that finding the optimal parameters of two quite different approaches of binary classification, AdaBoost and Logistic Regression, can both be simultaneously viewed as the same Bregman distance optimization problem (with slightly different initial parameters). They then present several algorithms for solving this unified problem (and thus, for optimizing both AdaBoost and Logistic Regression), and prove the convergence of their algorithms with the method of Auxiliary functions developed in [1]. This paper was the first general proof of convergence for AdaBoost which was proposed by Yoav and Schapire (one of the authors of [2]) and earned them the Gödel prize in 2003.
If you don't mind me plugging in some expository work of mine, I wrote an essay ([3]) giving an introduction to Bregman distances and is pitched at a lower level than [1] and [2]. The end of the first chapter discusses in particular the general Bregman distance optimization problem, setting it up in the same framework as [1] and [2], and the final chapter presents the algorithm and proof of convergence originally given in [2] but hopefully with a slightly simplified presentation due to focusing only on the Logistic Regression case of the algorithm.
In case you want to play around with it, I have implemented the algorithm from [2], as well as a related algorithm from [4] which incorporates L1 (Ivanov) regularization into that algorithm, both being available at [5]. The middle chapters contain brief discussions on the relation of Bregman distances with Exponential Families, and on Generalized Linear Models, which are relevant to the overall purpose of the essay but not so closely related to the content of [1] and [2] and may safely be skipped.
If you generally enjoy the types of problems discussed in [1] and [2], you might also enjoy some of these papers: [6] [7] [8] [9].
--------------------------------------
[1] - "Duality and Auxiliary Functions for Bregman Distances". Stephen Della Pietra, Vincent Della Pietra, and John Lafferty, 2001.
[2] - "Logistic Regression, AdaBoost and Bregman Distances". Robert Schapire, Michael Collins, Yoram Singer, 2001.
[3] - "Optimisation of Bregman Divergences". Ragib Zaman, 2018. https://github.com/RagibZaman/mathematical-optimisation/blob...
[4] - "Bregman distance to L1 regularized logistic regression". T. Huang and M. Gupta, International Conference on Pattern Recognition, 2008.
[5] - Notebook containing implementations of Bregman divergence based algorithms for Logistic Regression from [2] and [4]. https://github.com/RagibZaman/mathematical-optimisation/tree...
[6] - "Legendre functions and the method of random Bregman projections." H. Bauschke and J. Borwein, Journal of Convex Analysis, 1997.
[7] - "Inducing features of random fields". Stephen Della Pietra, Vincent Della Pietra, and John Lafferty, 1997.
[8] - "Statistical learning algorithms based on Bregman distances". Stephen Della Pietra, Vincent Della Pietra, and John Lafferty, 1997.
[9] - " A maximum entropy approach to natural language processing". Adam L. Berger, Stephen Della Pietra and Vincent Della Pietra. Computational Linguistics, 1996.
For the 2 months I've cut down pretty drastically - No caffeine after 4pm. Only taking it on workdays, at 11am and 3pm. 1 shot per coffee (no large size or double shots).
Surprisingly, I haven't noticed any real negative effects. I think it would be worse going totally to zero. Maybe you'll be able to get the benefits you want by a reduction without going cold turkey?
Another thing to do your own research on, but I also started having Theanine alongside my coffee, and I feel like it's functioning as intended in terms of reducing jittery-ness, some of the random mild muscle twitches I sometimes got with high caffeine/low sleep, and less of that heavy heartbeat I sometimes used to get. Unfortunately there's considerate overlap between when I started reducing my caffeine intake and also supplementing Theanine, so I don't know how much to attribute to what...
Also, decaf does not taste noticeably different to me. I started ordering decaf e.g. on weekends, and it's made surprisingly little difference. I did get a few comments when my friends noticed, but no negative pressure, most people tend to be sympathetic to someone trying to reduce their caffeine intake I've found.
1 - As some people have already clarified for other commenters, it indeed makes no difference how Player 1 picks their numbers. They can pick them from some distribution of their own, or in an adversarial manner. The probability of winning by following the strategy in the paper is still strictly greater than 1/2.
2 - In fact, even if Player 1 can read Player 2's mind and knows their strategy and even the exact distribution they will sample from (but can't see into the future to see the sample from the distribution), the probability is still strictly greater than 1/2.
3 - Since it isn't actually included in the paper or any of the comments, for the sake of completeness I'll write down the computation.
Let P(E) denote the probability of an event E, and W be the event that Player 2 wins by following the strategy suggested in the paper. Let a, b be the smaller, larger number respectively. A is the event that Player 2 picked a, B is the event that Player 2 picked b. Then summing over disjoint events,
P(W) = P(A and W) + P(B and W) = P(W | A)P(A) + P(W | B)P(B)
We have P(A) = P(B) = 1/2. Now let x be the result of Player 2 sampling from their distribution. Given that they picked A, they win if and only if a <= x, so P(W | A) = P(a <= x). Given that they picked B, they win if and only if x < b, so P(W | B) = P(x < b). Therefore,
P(W) = (1/2) [P(a <= x) + P(x < b)] = (1/2) [1 + P( x in [a,b) )]
4 - If I were to show this problem to someone else, I may try to emphasize the potentially adversarial nature of Player 1 and the odds seemingly being stacked against Player 2 by phrasing it like this (although this may be _over_ exaggerated):
* Player 1 gets to write down any two distinct real numbers on two pieces of paper, and then flips a coin. Player 2 gets to see the number on the left if the coin lands on Heads, the number on the right if the coin lands on Tails. After seeing the number, Player 2 must declare whether they are seeing the smaller or larger number. If Player 2 guesses correctly, they win $1 from Player 1. Otherwise, Player 2 pays $1 to Player 1.
Further, now knowing the rules of the game, both players can choose any particular strategy of playing the game. However, whatever Player 2 chooses as their strategy, they must inform Player 1 of their strategy and not deviate from it when the game is played. Player 1 is allowed to adjust their strategy after hearing Player 2s strategy. Would you prefer to be Player 1 or Player 2? *
I think worded like that, many peoples first guess might even be Player 1. Then their next answer would be that it doesn't matter, and then they're in for a treat when they see that they should choose to be Player 2!
I feel like this depends on the type of dev. If you write C code for microcontrollers then who cares, but if you do web dev then using a generic template not authored by you seems like a bad sign, no?
If the "refined approximation" assumes it's easy to 1) subtract 10% 2) double and 3) add 31, then it should be just as easy to 1) double 2) subtract 10% and 3) add 32 - i.e. the exact conversion formula.
Edit: hah, I type very slow on my phone evidently. strikelaserclaw's advice here is very similar to this :)