Video

Sir, there is no youtube video on cubist model. Could you kindly make a video on cubist regression.

WHere is the source code?

Gemini 1.5 Pro: This video is about Google Vizier, a service for blackbox optimization developed by Google. Blackbox optimization is a type of optimization where the system you are trying to optimize is opaque, meaning you can only evaluate different configurations by running experiments. Vizier makes it easy to define and run these experiments, and it also provides a number of features to help you improve the efficiency of your search. Here are the key design goals of Vizier: * Ease of use: Vizier is designed to be easy to use, even for people who are not familiar with blackbox optimization. * Availability: Vizier is highly available, so you can be confident that it will be up and running when you need it. * Scalability: Vizier can scale to handle large workloads, so you can use it to optimize even the most complex systems. * Performance: Vizier uses state-of-the-art algorithms to find the best possible configuration for your system. * Flexibility: Vizier is flexible and can be used to optimize a wide variety of systems. Vizier is a powerful tool that can be used to optimize a wide variety of systems. It is easy to use, available, scalable, performs well, and flexible. If you are looking for a way to improve the performance of your system, Vizier is a great option to consider. Some of the applications of Vizier include: * Automated optimization for user interfaces or user experience * Optimizing machine learning models * Physical design problems * Robotics One interesting example of how Vizier has been used is to design chocolate chip cookies. By parameterizing the space of possible cookie recipes, Vizier was able to generate a series of cookies that were then taste-tested by humans. The results of this experiment were used to improve the Vizier algorithm.

Hello dear Sir, I have question what is the difference between vanilla-based causality and optimal Markov blanket?

Can u send me your pdf too

Such an amazing session!!!!

I think an approach like this need to be explained step-by-step and without music in the background.

How do I get the code for this method?

A really good explanation on math behind Stumpy package. I also downloaded the presentation from the UCR website. A minor thing. On slide 23, is it should be n/2 > m instead of n > m/2?

This video was perfect for where I'm at educationally, thank you. Very informative.

Really well explained ! Thank you for the lecture. Is the material presented available ?

I would like to thank you for share the presentation, but 90% of screen is the audience and not the presentation (or the presenter). It's a waste of space, information and resources.

how to compute the visual graph at 26:52 ? i don't really understand the meaning of the x and y axis

I can't believe it can be this good

I appreciate the upload. Thanks for the video!

Such neatly explained. Shows the intuition well. loved it!

This research is great. I'd be very grateful if you can share the related implementation and database.

Where is the tutorial website

Hello sir, this video is inspiring thank you. please 🙏 how can I predict unknown geographical companies locations from known geographical companies locations and map representation, have some relevant data such as population density, economic infrastructures, main roads, electrical network lines..

😴😴😴

If you take a simple time series and compute her matrice profile it will be more useful than one speech of 1 hour

Brian Christian brought me here.

Hello sir can you please tell me how to use ego algorithm if our function is not known at all

great talk ever

Crypt-O is a tool for evil. Illuminati & evil elites use it for child sex trafficking and buying/selling adrenochrome. Watch what's being revealed since the Ghislaine Maxwell indictment. Evenually, it can and will be brought down.

the sound is not good I am quite disappointed

The video sound is pretty good, beyond my imagination

audience has no sense of humor

1.5xx

Great job!

any idea where I can get the slides?

Isn't time complexity of STMP O((n-m+1)*n*logn) as you run the MASS algorithm n-m+1 times? Or is it because you can assume that n >> m therefore, n-m+1=n ?

Thanks for the detailed explanation

Interesting talk!

Just call it a voronie diagram

your only as strong as your weakest link!

can u plsssssssss send me the pdf

the previous time stamp is t-dt1 and the next time stamp is t+dt2 because the gap is irregular. it will not be correct to say t-1,t,t+1 in irregular scenario. this is what i think.

Is there a link to his other talk he mentions at the end?

wow, that's smart :O

Thank you for offering so great video :) Is the number ego-net cluster is a hyper-parameter? or is it being naturally defined according to the network structure?

Very cool video

...

Hi, what is Time complexity of co-training?

Great lecture. I loved the level of detail and examples. How can reach you for questions?

I am trying so hard to understand what he is saying.. :-( :-(.. He accent and pronunciation is very difficult to understand.

Very interesting work! Opens a whole new perspective on time series analysis!

are the slides available?

bookerystore.com/downloads/bandit-algorithms/

Which method is currently using for Android malware detection? Please reply soon