Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Pseudo-branching #190

Draft
wants to merge 14 commits into
base: main
Choose a base branch
from
Draft

Pseudo-branching #190

wants to merge 14 commits into from

Conversation

LeChStan
Copy link

@LeChStan LeChStan commented Jun 5, 2024

No description provided.

@dhendryc dhendryc self-requested a review June 5, 2024 10:56

n = 6

const diffw = 0.5 * ones(n)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

For testing, this is fine. Just beware that in this case all possible nodes will be created and evaluated because any vertex of the hypercube is optimal. The diffw from the approx planted point example might be the better choice.

heu = Boscia.Heuristic((tree, blmo, x) -> Boscia.follow_gradient_heuristic(tree,blmo,x, depth), 0.2, :follow_gradient)
heuristics = [heu]
# heuristics = []
iterations_stable = 3::Int# how many times until we consider a pseudocost as stable
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The ::Int should not be necessary.

branching::PSEUDO_COST{BLMO}
) where BLMO <: BoundedLinearMinimizationOracle
@assert !isempty(node.active_set)
active_set = copy(node.active_set)
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

If you are emptying the active set anyway, you can just create an empty one: https://github.com/ZIB-IOL/FrankWolfe.jl/blob/9009acab5d397d71cedee6156977d7d92f79b0b6/src/active_set.jl#L27

The active sets can be come quite large and copying them might lead to some unnecessary overhead.

… from approx planted example, also added a \mu for a potential branching score function
…rt. Current version runs but on the HiGHS_example with diffw = Random.rand(Bool, n) * 0.6 .+ 0.3 it does not change strategy before solving the problem.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants