Satoshi Hara, Takanori Maehara. Convex Hull Approximation of Nearly Optimal Lasso Solutions. In Proceedings of 16th Pacific Rim International Conference on Artificial Intelligence, Part II, pages 350--363, 2019.
ERATO感謝祭 Season IV
【参考】Satoshi Hara and Takanori Maehara. Enumerate Lasso Solutions for Feature Selection. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI'17), pages 1985--1991, 2017.
ERATO感謝祭 Season IV
【参考】Satoshi Hara and Takanori Maehara. Enumerate Lasso Solutions for Feature Selection. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI'17), pages 1985--1991, 2017.
Big Data is a new term used in Business Analytics to identify datasets that we can not manage with current methodologies or data mining software tools due to their large size and complexity. Big Data mining is the capability of extracting useful information from these large datasets or streams of data. New mining techniques are necessary due to the volume, variability, and velocity, of such data.
In this talk, we will focus on advanced techniques in Big Data mining in real time using evolving data stream techniques: using a small amount of time and memory resources, and being able to adapt to changes. We will discuss a social network application of data stream mining to compute user influence probabilities. And finally, we will present the MOA software framework with classification, regression, and frequent pattern methods, and the SAMOA distributed streaming software that runs on top of Storm, Samza and S4.
https://telecombcn-dl.github.io/2017-dlai/
Deep learning technologies are at the core of the current revolution in artificial intelligence for multimedia data analysis. The convergence of large-scale annotated datasets and affordable GPU hardware has allowed the training of neural networks for data analysis tasks which were previously addressed with hand-crafted features. Architectures such as convolutional neural networks, recurrent neural networks or Q-nets for reinforcement learning have shaped a brand new scenario in signal processing. This course will cover the basic principles of deep learning from both an algorithmic and computational perspectives.
Similar to Convex Hull Approximation of Nearly Optimal Lasso Solutions (20)
Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and...Satoshi Hara
【NeurIPS 2018 読み会 in 京都】
Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds
https://papers.nips.cc/paper/8120-theoretical-linear-convergence-of-unfolded-ista-and-its-practical-weights-and-thresholds
* Satoshi Hara and Kohei Hayashi. Making Tree Ensembles Interpretable: A Bayesian Model Selection Approach. AISTATS'18 (to appear).
arXiv ver.: https://arxiv.org/abs/1606.09066#
* GitHub
https://github.com/sato9hara/defragTrees
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
2. Background Lasso and Enumeration
n Lasso Typical approach for feature selection
min
$
1
2
'( − * + + - ( . =: 1 ( , ', * ∈ ℝ5 ×7×ℝ5
n Enumeration for feature selection [Hara & Maehara, AAAI’17]
• Helpful for gaining more insights of data.
2
Ordinary Lasso
• One global optimum, i.e.,
one feature set, is obtained.
Enumeration of Lasso
• Several possible solutions, i.e.,
multiple feature sets, are obtained.
I found one feature set that is
helpful for predicting energy
consumption.
Found:
{Wall Area, Glazing Area}
I found several feature sets
that are helpful for predicting
energy consumption.
Found:
{Wall Area, Glazing Area},
{Wall Area, Overall Height},
{Roof Area, Glazing Area}, …
3. Background Lasso and Enumeration
n Example Lasso Enumeration for 20Newsdata
• Identifying relevant words for article classification.
3
Selected words
in Lasso
solution
adb apple bios bus cable com controller
dos drivers duo fpu gateway ibm ide
mac motherboard simm vlb vram windows
4. Background Lasso and Enumeration
n Example Lasso Enumeration for 20Newsdata
• Identifying relevant words for article classification.
4
Selected words
in Lasso
solution
adb apple bios bus cable com controller
dos drivers duo fpu gateway ibm ide
mac motherboard simm vlb vram windows
Model7
Remove motherboard
cable
adb
drivers
Model8
Remove motherboard
cable
adb
drivers
Model9
Remove motherboard
cable
adb
drivers
Model4
Remove motherboard
cable
adb
drivers
Model5
Remove motherboard
cable
adb
drivers
Model6
Remove motherboard
cable
adb
drivers
Model1
Remove motherboard
cable
adb
drivers
Model2
Remove motherboard
cable
adb
drivers
Model3
Remove motherboard
cable
adb
drivers
Enumerated Models
5. Background Lasso and Enumeration
n Example Lasso Enumeration for 20Newsdata
• Identifying relevant words for article classification.
5
Selected
words in
Lasso
solution
adb apple bios bus cable com controller
dos drivers duo fpu gateway ibm ide
mac motherboard simm vlb vram windows
Model7
Remove motherboard
cable
adb
drivers
Model8
Remove motherboard
cable
adb
drivers
Model9
Remove motherboard
cable
adb
drivers
Model4
Remove motherboard
cable
adb
drivers
Model5
Remove motherboard
cable
adb
drivers
Model6
Remove motherboard
cable
adb
drivers
Model1
Remove motherboard
cable
adb
drivers
Model2
Remove motherboard
cable
adb
drivers
Model3
Remove motherboard
cable
adb
drivers
Enumerated Models
Drawback of Enumeration
Enumerated models can be just a combination
of a few representative patterns.
Exponentially many combinations of similar models can be found.
These similar models are not helpful for gaining insights.
6. Goal of This Study
n Goal
Find small numbers of diverse models.
large numbers similar
n Overview of the Proposed Approach
• Define a set of good models.
! " ≔ $: & $ ≤ "
• Find vertices of ! " .
Vertices = sparse models
Vertices are distinct -> diversity
6
! !Enumeration
" "
7. Outline
n Background and Overview
n Problem Formulation
n Proposed Method
n Experiments
n Summary
7
8. Properties of ! "
n ! " ≔ $: & $ ≔
'
(
)$ − + (
+ - $ ' ≤ "
• A set of models with sufficiently small Lasso objectives.
1. ! " consists of smooth boundaries
and non-smooth vertices.
• Smooth boundaries = dense models
• Non-smooth vertices = sparse models
2. A convex hull of the set of vertices /
can approximate ! " well.
• conv / ≈ ! "
8
9. Problem Approximation of ! "
n Our Approach
Approximate !(") by a set of % points & = () )*+
,
.
n To attain good approximation,
the vertices - of !(") should
be selected as &.
9
10. Problem Approximation of ! "
n Our Approach
Approximate !(") by a set of % points & = () )*+
,
.
n Question How to measure the approximation quality?
10
!(")
How similar
they are?
We use Hausdorff distance.
& = () )*+
,
11. Problem Approximation of ! "
n Def. Hausdorff distance between the two sets.
• Maximum margin in the non-overlapping region.
#$ %, %′ ≔ max sup
/∈1
inf
/5∈15
6 − 68 , sup
/8∈18
inf
/∈1
6 − 68
n We measure the approximation quality by using #$.
Problem Minimization of Hausdorff distance
min
9
#$ conv = , !(") , s. t. = ≤ C
11
%
%′
!(")
conv =Measure #$ = = EF FGH
I
12. Outline
n Background and Overview
n Problem Formulation
n Proposed Method
n Experiments
n Summary
12
13. Method Sampling + Greedy Selection
n Step1 Sampling points from the boundary of ! "
n Step2 Greedily select # points to minimize $%.
13
Step1 Sampling Step2 Greedy Selection
14. Step1 Sampling
n Note Want to sample vertices as much as possible.
n Proposed Sampling Method
• Take a random direction.
• Find an “edge” of ! " at that direction.
14
This method can sample
vertices with high probabilities.
15. Step1 Sampling
n Finding an “edge”
max$ %&', s. t. ' ∈ -(/) (%: random direction)
n Finding an “edge” by binary search
• Dual Problem
min
345
max
$
%&' − 7(8 ' − /)
• Find ' that satisfies 8 ' = /
by finding optimal 7 by using
binary search.
15
solvable with Lasso solvers
large 7
small 7
optimal 7
16. Method Sampling + Greedy Selection
n Step1 Sampling points from the boundary of ! "
n Step2 Greedily select # points to minimize $%.
16
Step1 Sampling Step2 Greedy Selection
17. Step2 Greedy Selection
n Original Problem
min
$
%& conv * , ,(.) , s. t. * ≤ 4
n Approximate , . with the sampled points 5.
• , . ≈ conv 5
min
$⊆8
%& conv * , conv 5 , s. t. * ≤ 4
• Remark
%& conv * , conv 5 = max
<∈8
min
<>∈?@AB $
C − C′
17
,(.)
conv(5)
conv *Measure %&
≈
18. Step2 Greedy Selection
n The problem is NP-hard in general.
• min
$⊆&
'( conv , , conv . , s. t. , ≤ 3
n Our Approach Greedy Selection
• Initialization step
Select one point 4 ∈ .
, 6 ← 4 , . ← . ∖ {4}, and ; ← 1
• While ; < 3
>4 ∈ max
A∈&
min
AB∈CDEF $ G
4 − 4′
, JK6 ← , J ∪ >4 , . ← . ∖ { >4}, and ; ← ; + 1
18
conv(.)
conv(,)
Greedily add one point to ,
that minimizes the objective.
19. Step2 Greedy Selection
n The problem is NP-hard in general.
• min
$⊆&
'( conv , , conv . , s. t. , ≤ 3
n Our Approach Greedy Selection
• Initialization step
Select one point 4 ∈ .
, 6 ← 4 , . ← . ∖ {4}, and ; ← 1
• While ; < 3
>4 ∈ max
A∈&
min
AB∈CDEF $ G
4 − 4′
, JK6 ← , J ∪ >4 , . ← . ∖ { >4}, and ; ← ; + 1
19
conv(.)
conv(,)
Greedily add one point to ,
that minimizes the objective.
20. Step2 Greedy Selection
n The problem is NP-hard in general.
• min
$⊆&
'( conv , , conv . , s. t. , ≤ 3
n Our Approach Greedy Selection
• Initialization step
Select one point 4 ∈ .
, 6 ← 4 , . ← . ∖ {4}, and ; ← 1
• While ; < 3
>4 ∈ max
A∈&
min
AB∈CDEF $ G
4 − 4′
, JK6 ← , J ∪ >4 , . ← . ∖ { >4}, and ; ← ; + 1
20
conv(.)
conv(,)
Greedily add one point to ,
that minimizes the objective.
21. Step2 Greedy Selection
n The problem is NP-hard in general.
• min
$⊆&
'( conv , , conv . , s. t. , ≤ 3
n Our Approach Greedy Selection
• Initialization step
Select one point 4 ∈ .
, 6 ← 4 , . ← . ∖ {4}, and ; ← 1
• While ; < 3
>4 ∈ max
A∈&
min
AB∈CDEF $ G
4 − 4′
, JK6 ← , J ∪ >4 , . ← . ∖ { >4}, and ; ← ; + 1
21
conv(.)
conv(,)
Greedily add one point to ,
that minimizes the objective.
22. Step2 Greedy Selection
n Details of computing !" ∈ max
'∈(
min
'+∈,-./ 0 1
" − "′
n 1. Computing min Quadratic Programming (QP)
• min
'+∈,-./ 0 1
" − "′
⇔ min
5
" − 6
7
8797 , s. t. 8 ≥ 0, 6
7
87 = 1
n 2. Computing max Lazy Update
• A naïve implementation requires searching over all " ∈ B.
• By using a monotonicity of the Hausdorff distance, we
can skip redundant computations and accelerate the
search.
22
23. Method Sampling + Greedy Selection
n Step1 Sampling points from the boundary of ! "
• Sampling random directions + Lasso + Binary Search
n Step2 Greedily select # points to minimize $%.
• Greedy selection
23
Step1 Sampling Step2 Greedy Selection
24. Outline
n Background and Overview
n Problem Formulation
n Proposed Method
n Experiments
n Summary
24
25. Synthetic Experiment Visualization of ! " and #
n Synthetic Problems
• 2D ver. $ =
1 1
1 1 + 1/40
, , =
1
1
• 3D ver. $ =
1 1 1
1 1 + 1/40 1
1 1 1 + 2/40
, , =
1
1
1
n Results
25
2D ver. 3D ver. Hausdorff dist.
2D ver.
3D ver.
26. Synthetic Experiment High-dimensional Data
n Synthetic data
• ! = #$% + '
• % ∼ ) 0, , , ,-. = exp −0.1|6 − 7|
• dimensionality of % = 100
n Result
• Huadorff dist. decreases
as 8 increases.
• Huadorff dist. decreases
as the sampling size 9 increases.
The effect is marginal, though.
In practice, 9 ≈ 1,000 would suffice.
26
27. Real-Data Experiment Diversity verification
n Data: 20Newsgroups
• Classification of news articles into two categories.
(ibm or mac)
• Feature selection = Identification of important words.
! ∈ ℝ$$%&': tf-idf weighted bag-of-words
( ∈ {0, 1}: categories of articles
# of data: 1168
n Model
• Linear logistic regression + ℓ$
n Baseline Methods [Hara & Maehara, AAAI’17]
• Enumeration Exact enumeration of top-K models
• Heuristic Skip similar models while enumeration.
27
28. Real-Data Experiment Diversity verification
n Comparison of the found 500 models
n Visualization with PCA
• Projected found models with PCA.
• The proposed method attained
the largest diversity.
28
Found Words
Enumeration 39
Heuristic 63
Proposed 889
apple macs macintosh
Enumeration ✘ ✘
Heuristic ✘
Proposed
Baseline methods found
combinations of a few
representative patterns only.
Baseline methods missed
some important words.
29. Summary
n Our Goal
• Find small numbers of diverse models for Lasso.
n Our Method
• Find “vertices” of a set of models ! " ≔ $: & $ ≤ "
• Problem: Hausdorff distance minimization.
• Method: Sampling + Greedy Selection
n Verified the effectiveness of the proposed method.
• The proposed method could
find points that can well approximate ! " .
obtain diverse models than the existing enumeration
methods.
29
GitHub: /sato9hara/LassoHull