Optimizing Across Noisy Domain

  • Thread starter Thread starter tangodirt
  • Start date Start date
  • Tags Tags
    Domain
AI Thread Summary
Established methods for optimizing across a noisy 2D surface include filtering techniques like the median filter, but the effectiveness depends on specific criteria for optimality, the nature of the expression being optimized, and additional details such as constraints and the need for speed in solving. The discussion emphasizes the importance of defining what "optimal" means in the context of a noisy function, as noise can significantly affect the perceived maximum or minimum. Suggestions include considering the characteristics of the noise and potentially using techniques like Singular Value Decomposition (SVD), although this may still require computing the entire surface. Without more details about the problem, it's challenging to provide targeted advice. Clarifying the optimization criteria and noise characteristics is essential for effective solutions.
tangodirt
Messages
51
Reaction score
1
Are there any established methods for optimizing across a 2D surface with noise? I am trying to find the maximum across a 2D surface, but the surface is extremely noisy. Ideally, I would numerically optimize a function without resorting to computing the entire surface, filtering the surface, and searching for a maximum, but I am not finding any established methods for this.

Any ideas?
 
Mathematics news on Phys.org
'Optimize' can mean almost anything. The right thing to do will strongly depend on

1. The criterion by which you are defining optimality ,

2. The form of the expression you are optimizing, and

3. Any other detauls that matter: constraints, continuous or discrete space, whether this is somethig that must be solved many time very quickly or if it just done once in awhile and can run a long time to converge, etc.

Unless you provide more details folks here cannot do much to help you.

Jason
 
jasonRF said:
'Optimize' can mean almost anything. The right thing to do will strongly depend on

1. The criterion by which you are defining optimality ,

2. The form of the expression you are optimizing, and

3. Any other detauls that matter: constraints, continuous or discrete space, whether this is somethig that must be solved many time very quickly or if it just done once in awhile and can run a long time to converge, etc.

Unless you provide more details folks here cannot do much to help you.

Jason

1. Maximize/minimize over a known domain.

2. It is a generic function. A black box with two inputs that returns an output that is noisy.

3. Something that needs to be solved many times, very quickly.

Think of this as Excel's "Solver", but with a noisy function.
 
I've never used excel's solver - you aren't describing what 'optimal' means. If your function is noisy, the maximum or minimum will likely be due to noise, not what you care about. So ... what does 'optimal' mean in this instance? What do you know about the problem (characteristics of noise, etc.)?

jason
 
Would the SVD be helpful? It would presumably still require you to compute the entire surface, though.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Back
Top